Infinite circulant digraphs and random infinite circulant digraphs

DOI10.1007/s10114-002-0220-8zbMath1029.05070OpenAlexW2063363084MaRDI QIDQ1566003

Ji Xiang Meng, Fu Ji Zhang, Qiang Xiang Huang

Publication date: 8 February 2004

Published in: Acta Mathematica Sinica. English Series (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10114-002-0220-8

zbMATH Keywords

connectivityHamiltonian paths

Mathematics Subject Classification ID

Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Directed graphs (digraphs), tournaments (05C20) Connectivity (05C40) Eulerian and Hamiltonian graphs (05C45)

Related Items (1)

Norm equalities and inequalities for three circulant operator matrices

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Discussion on the convergence of Rosen's gradient projection method
• Infinite Hamiltonian paths in Cayley digraphs
• On the automorphism groups of almost all Cayley graphs
• Connectivities of random circulant digraphs
• Connectivities of minimal Cayley coset digraphs
• The diameters of almost all Cayley digraphs
• Almost all Cayley graphs have diameter 2
• Circulants and their connectivities
• Connectivity of circulant digraphs
• Almost all Cayley graphs are hamiltonian
• A survey: Hamiltonian cycles in Cayley graphs

This page was built for publication: Infinite circulant digraphs and random infinite circulant digraphs