๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Products of Circulant Graphs Are Metacirculant

โœ Scribed by Robin S. Sanders

Publisher
Elsevier Science
Year
2002
Tongue
English
Weight
107 KB
Volume
85
Category
Article
ISSN
0095-8956

No coin nor oath required. For personal study only.

โœฆ Synopsis

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

๐Ÿ“œ 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.

Flows in circulant graphs of odd order a
Flows in circulant graphs of odd order are sums of Hamilton cycles
โœ Stephen C. Locke; Dave Witte ๐Ÿ“‚ Article ๐Ÿ“… 1989 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 889 KB

We show any flow in any connected circulant graph of odd order can be expressed as a sum of Hamilton cycles.