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 belonging to this set have the same length and their diameter corresponds to the diameter of the chordal ring in which they are embedded. The members of this embedded set of rings are non-disjoint and preserve the minimal routing of the original circulant graph. Besides its practical consequences, our research allows the presentation of these optimal circulant graphs as a particular evolution of the traditional ring topology. Key words.– Circulant graphs, Chordal Rings, Cycles, ´Adam’s Conjecture, Graph Embedding.

• Type: Conference
• Year: 2003
• Where: ITCC
• Authors: Carmen Martínez, Ramón Beivide, Jaime Gutierrez, Cruz Izu
• Keywords: Chordal Rings, Circulant Graphs, ITCC 2003, Optimal Chordal Rings