Connectivity of circulant digraphs

DOI10.1002/jgt.3190100103zbMath0594.05042OpenAlexW2125292347MaRDI QIDQ3724371

Erik A. van Doorn

Publication date: 1986

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://research.utwente.nl/en/publications/connectivity-of-circulant-digraphs(a0dae48d-6b0e-4731-8f9c-c7afaa751022).html

zbMATH Keywords

circulant digraphvertex connectivity

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Connectivity (05C40)

Related Items (22)

A survey on multi-loop networks. ⋮ Connectivities of random circulant digraphs ⋮ Connectivities of minimal Cayley coset digraphs ⋮ The Hamiltonian property of the consecutive-3 digraphs ⋮ Large fault-tolerant interconnection networks ⋮ Hamiltonian cycles in circulant digraphs with two stripes ⋮ The property of Hamiltonian connectedness in Toeplitz graphs ⋮ Hamiltonian properties of Toeplitz graphs ⋮ Superconnectivity for minimal multi-loop networks ⋮ Necessary and sufficient conditions for circulant digraphs to be antistrong, weakly-antistrong and anti-Eulerian ⋮ THE CONNECTIVITY OF EXCHANGED HYPERCUBES ⋮ Characterizing bipartite Toeplitz graphs ⋮ Improved upper and lower bounds on the optimization of mixed chordal ring networks ⋮ The minimum rank problem for circulants ⋮ Isomorphisms of circulant digraphs ⋮ Connectivity and diameter in distance graphs ⋮ The Hamiltonian property of linear functions ⋮ Infinite circulant digraphs and random infinite circulant digraphs ⋮ Reliabilities of Double-Loop Networks ⋮ Miscellaneous Digraph Classes ⋮ High connectivity keeping sets in graphs and digraphs ⋮ The Hamiltonian property of consecutive-\(d\) digraphs

Cites Work

• On Point-Symmetric Tournaments

This page was built for publication: Connectivity of circulant digraphs