534 search results - page 5 / 107 » Diameter critical graphs |
DM
2002
13 years 9 months ago
2002
We disprove a conjecture of Bultena and Ruskey [1], that all trees which are cyclic graphs of cyclic Gray codes have diameter 2 or 4, by producing codes whose cyclic graphs are tre...
COMBINATORICS
2006
13 years 9 months ago
2006
For undirected graphs it has been known for some time that one can bound the diameter using the eigenvalues. In this note we give a similar result for the diameter of strongly con...
JGT
2006
13 years 9 months ago
2006
Given a configuration of pebbles on the vertices of a graph G, a pebbling move consists of taking two pebbles off some vertex v and putting one of them back on a vertex adjacent t...
IWCIA
2004
Springer
14 years 3 months ago
2004
Springer
Regions in an image graph can be described by their spanning tree. A graph pyramid is a stack of image graphs at different granularities. Integral features capture important prope...
KDD
2005
ACM
14 years 10 months ago
2005
ACM
How do real graphs evolve over time? What are "normal" growth patterns in social, technological, and information networks? Many studies have discovered patterns in stati...