scientific article; zbMATH DE number 4150206

MaRDI QIDQ3480079zbMATH OpenFDO

Authors Jun-Ming Xu

Publication date 1989

zbMATH Keywords

circulant digraphstrong connectivity

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 1135766
• Connectivity of circulant digraphs
• The connectivity of directed circulant graphs
• Connectivities of random circulant digraphs
• Circulants and their connectivities

Cited in

(20)

• Endo-circulant digraphs: Connectivity and generalized cycles
• Connectivities of random circulant digraphs
• On \(k\)-strong and \(k\)-cyclic digraphs
• Infinite circulant digraphs and random infinite circulant digraphs
• Necessary and sufficient conditions for circulant digraphs to be antistrong, weakly-antistrong and anti-Eulerian
• Strong connectedness of generalized circulant digraphs
• The connectivity of directed circulant graphs
• scientific article; zbMATH DE number 5811576 (Why is no real title available?)
• scientific article; zbMATH DE number 3910427 (Why is no real title available?)
• Connectivity of circulant digraphs
• scientific article; zbMATH DE number 4057536 (Why is no real title available?)
• scientific article; zbMATH DE number 1382546 (Why is no real title available?)
• On strong digraphs with a prescribed ultracenter
• scientific article; zbMATH DE number 1135766 (Why is no real title available?)
• scientific article; zbMATH DE number 4119945 (Why is no real title available?)
• scientific article; zbMATH DE number 871178 (Why is no real title available?)
• Loop conditions for strongly connected digraphs
• How to make a strongly connected digraph two-connected
• (Strong) proper vertex connection of some digraphs
• Finding coherent cyclic orders in strong digraphs

This page was built for publication:

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