632 search results - page 2 / 127 » On Routing in Circulant Graphs |
COMBINATORICS
1998
13 years 5 months ago
1998
A circulant graph G of order n is a Cayley graph over the cyclic group Zn. Equivalently, G is circulant iff its vertices can be ordered such that the corresponding adjacency matr...
WG
2004
Springer
13 years 11 months ago
2004
Springer
It has long been known that the number of spanning trees in circulant graphs with fixed jumps and n nodes satisfies a recurrence relation in n. The proof of this fact was algebra...
DM
2006
13 years 5 months ago
2006
Let 1 s1 < s2 <
DM
2006
13 years 5 months ago
2006
A graph is called almost self-complementary if it is isomorphic to one of its almost complements Xc - I, where Xc denotes the complement of X and I a perfect matching (1-factor) i...
DAM
2011
13 years 16 days ago
2011
In 1988, Golumbic and Hammer characterized powers of cycles, relating them to circular-arc graphs. We extend their results and propose several further structural characterizations ...