scientific article; zbMATH DE number 4025476

MaRDI QIDQ3767375zbMATH OpenFDO

Authors Mark E. Watkins

Publication date 1985

zbMATH Keywords

adjacency matrixconnectivityfinite circulant graph

Mathematics Subject Classification ID

Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Connectivity (05C40) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50)

Recommendations

• scientific article; zbMATH DE number 1382546
• On computing the connectivities of graphs and digraphs
• Circulants and their connectivities
• Infinite circulant digraphs and random infinite circulant digraphs
• Connectivity of circulant digraphs

Cited in

(8)

• Properties of graphs with polynomial growth
• A survey on graphs with polynomial growth
• Infinite circulants and their properties
• The connectivity of directed circulant graphs
• On computing the connectivities of graphs and digraphs
• scientific article; zbMATH DE number 1382546 (Why is no real title available?)
• Computing Vertex Connectivity: New Bounds from Old Techniques
• The Component (Edge) Connectivity of Round Matching Composition Networks

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 Q3767375)