𝔖 Bobbio Scriptorium
✦   LIBER   ✦

The Existence of Selfcomplementary Circulant Graphs

✍ Scribed by Dalibor Fronček; Alexander Rosa; Jozef Širáň

Publisher
Elsevier Science
Year
1996
Tongue
English
Weight
194 KB
Volume
17
Category
Article
ISSN
0195-6698

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Reliability analysis of circulant graphs
Reliability analysis of circulant graphs
✍ Li, Qiaoliang; Li, Qiao 📂 Article 📅 1998 🏛 John Wiley and Sons 🌐 English ⚖ 82 KB 👁 2 views

The circulant graphs are of particular interest as models of communication networks. In this work, we present new reliability analysis results for circulants based on the concept of restricted edge connectivity, which generalizes the super-l property of a graph. We evaluate the restricted edge conne

Pancyclicity of connected circulant grap
Pancyclicity of connected circulant graphs
✍ Bogdanowicz, Z. R. 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 299 KB 👁 1 views

The circulant G,(al,. . . , ak), where 0 < al < ... < a k < ( n + 1 ) / 2 , is defined as the vertex-transitive graph that has vertices ifal,. . . ,if a k (mod n) adjacent to each vertex i. In this work we show that the connected circulants of degree at least three contain all even cycles. In additi

Pancyclicity of recursive circulant grap
Pancyclicity of recursive circulant graphs
✍ Toru Araki; Yukio Shibata 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 96 KB

In this paper, we study the existence of cycles of all lengths in the recursive circulant graphs, and we show a necessary and sufficient condition for the graph being pancyclic and bipancyclic.

On the average energy of circulant graph
On the average energy of circulant graphs
✍ Simon R. Blackburn; Igor E. Shparlinski 📂 Article 📅 2008 🏛 Elsevier Science 🌐 English ⚖ 122 KB

We obtain upper and lower bounds on the average energy of circulant graphs with n vertices and regularity d. The average is taken over all representations of such graphs by circulant adjacency matrices.

On isomorphic factorizations of circulan
On isomorphic factorizations of circulant graphs
✍ Brian Alspach; Danny Dyer; Donald L. Kreher 📂 Article 📅 2006 🏛 John Wiley and Sons 🌐 English ⚖ 112 KB

## Abstract We investigate the conjecture that every circulant graph __X__ admits a __k__‐isofactorization for every __k__ dividing |__E__(__X__)|. We obtain partial results with an emphasis on small values of __k__. © 2006 Wiley Periodicals, Inc. J Combin Designs 14: 406–414, 2006