Sciweavers

33 search results - page 1 / 7
» Self-complementary circulant graphs
Sort
View
85
Voted
COMBINATORICS
2007
72views more  COMBINATORICS 2007»
14 years 9 months ago
On Self-Complementary Cyclic Packing of Forests
A graph is self-complementary if it is isomorphic to its complement. In this paper we prove that every forest of order 4p and size less than 3p is a subgraph of a self-complementa...
A. Pawel Wojda, Mariusz Wozniak, Irmina A. Ziolo
76
Voted
WG
2004
Springer
15 years 2 months ago
Unhooking Circulant Graphs: A Combinatorial Method for Counting Spanning Trees and Other Parameters
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...
Mordecai J. Golin, Yiu-Cho Leung
92
Voted
DAM
2011
14 years 4 months ago
Powers of cycles, powers of paths, and distance graphs
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 ...
Min Chih Lin, Dieter Rautenbach, Francisco J. Soul...
74
Voted
ITCC
2003
IEEE
15 years 2 months ago
Distance-Hereditary Embeddings of Circulant Graphs
In this paper we present a distance-hereditary decomposition of optimal chordal rings of 2k2 nodes into a set of rings of 2k nodes, where k is the diameter. All the rings belongin...
Carmen Martínez, Ramón Beivide, Jaim...
ISHPC
2003
Springer
15 years 2 months ago
Chordal Topologies for Interconnection Networks
Abstract. The class of dense circulant graphs of degree four with optimal distance-related properties is analyzed in this paper. An algebraic study of this class is done. Two geome...
Ramón Beivide, Carmen Martínez, Cruz...