Strong connectedness of generalized circulant digraphs

MaRDI QIDQ2715176zbMATH OpenFDO

Authors Vumar Elkin, Xueliang Li

Publication date 20 June 2001

Published in Journal of Xinjiang University. Natural Science (Search for Journal in Brave)

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 4150206
• scientific article; zbMATH DE number 1135766
• Criteria and algorithms for irreducibility and aperiodicity of nonnegative matrices
• Connectivities of random circulant digraphs
• Non-singular circulant graphs and digraphs

Cited in

(9)

• scientific article; zbMATH DE number 871178 (Why is no real title available?)
• Loop conditions for strongly connected digraphs
• (Strong) proper vertex connection of some digraphs
• Hoffman polynomials of nonnegative irreducible matrices and strongly connected digraphs
• Endo-circulant digraphs: Connectivity and generalized cycles
• scientific article; zbMATH DE number 5811576 (Why is no real title available?)
• On matrices with cyclic structure
• Criteria and algorithms for irreducibility and aperiodicity of nonnegative matrices
• Necessary and sufficient conditions for circulant digraphs to be antistrong, weakly-antistrong and anti-Eulerian

This page was built for publication: Strong connectedness of generalized circulant digraphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2715176)