231 search results - page 10 / 47 » The Number of Independent Sets in a Regular Graph |
165
click to vote
COMBINATORICS
2006
15 years 6 months ago
2006
A proper edge colouring of a graph is neighbour-distinguishing if for all pairs of adjacent vertices v, w the set of colours appearing on the edges incident with v is not equal to...
143
click to vote
COLT
2004
Springer
15 years 11 months ago
2004
Springer
We consider the problem of labeling a partially labeled graph. This setting may arise in a number of situations from survey sampling to information retrieval to pattern recognition...
208
click to vote
FOCS
2009
IEEE
16 years 24 days ago
2009
IEEE
Abstract— Thorup and Zwick, in their seminal work, introduced the approximate distance oracle, which is a data structure that answers distance queries in a graph. For any integer...
189
click to vote
GC
2002
Springer
15 years 5 months ago
2002
Springer
Given a graph on n vertices which is the union of two comparability graphs on the same vertex set, it always contains a clique or independent set of size n 1 3 . On the other hand...
200
click to vote
FCS
2009
15 years 3 months ago
2009
A set S V is a dominating set of a graph G = (V; E) if each vertex in V is either in S or is adjacent to a vertex in S. A vertex is said to dominate itself and all its neighbors. ...