✦ LIBER ✦

PRODUCTS OF CIRCULANT GRAPHS

✍ Scribed by Broere, Izak; Hattingh, Johannes H.

Book ID: 118136613
Publisher: Taylor and Francis Group
Year: 1990
Tongue: English
Weight: 698 KB
Volume: 13
Category: Article
ISSN: 1607-3606
DOI: 10.1080/16073606.1990.9631612

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Products of Circulant Graphs Are Metacir

Products of Circulant Graphs Are Metacirculant

✍ Robin S. Sanders 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 107 KB

The standard products-cartesian, lexicographic, tensor, and strong-all belong to a class of products introduced by W.

Star Extremal Circulant Graphs

✍ Lih, Ko-Wei; Liu, Daphne Der-Fen; Zhu, Xuding 📂 Article 📅 1999 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 284 KB

Resolvability in circulant graphs

✍ Muhammad Salman, Imran Javaid, Muhammad Anwar Chaudhry 📂 Article 📅 2012 🏛 Institute of Mathematics, Chinese Academy of Scien 🌐 English ⚖ 248 KB

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.

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