483 search results - page 60 / 97 » On perfectness of sums of graphs |
COMBINATORICA
2007
13 years 8 months ago
2007
The k-th power of a graph G is the graph whose vertex set is V (G)k , where two distinct ktuples are adjacent iff they are equal or adjacent in G in each coordinate. The Shannon ...
CPAIOR
2006
Springer
14 years 12 days ago
2006
Springer
Abstract. We propose two algorithms achieving generalized arc consistency for the soft global cardinality constraint with variable-based violation and with value-based violation. T...
DM
2010
13 years 8 months ago
2010
We introduce the concept of an edge-colouring total k-labelling. This is a labelling of the vertices and the edges of a graph G with labels 1, 2, . . . , k such that the weights o...
DAM
2006
13 years 8 months ago
2006
The connectivity index w(G) of a graph G is the sum of the weights (d(u)d(v)) of all edges uv of G, where is a real number ( = 0), and d(u) denotes the degree of the vertex u. Le...
CIKM
2007
Springer
14 years 2 months ago
2007
Springer
Recently, due to its wide applications, subgraph search has attracted a lot of attention from database and data mining community. Sub-graph search is defined as follows: given a ...