scientific article; zbMATH DE number 4025476

zbMATH Open0631.05033MaRDI QIDQ3767375FDOQ3767375

Authors: Mark E. Watkins 

Publication date: 1985

Title of this publication is not available (Why is that?)

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

zbMATH Keywords

adjacency matrixconnectivityfinite circulant graph

Mathematics Subject Classification ID

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

Cited In (7)

• The connectivity of directed circulant graphs
• The Component (Edge) Connectivity of Round Matching Composition Networks
• Computing Vertex Connectivity: New Bounds from Old Techniques
• Title not available (Why is that?)
• A survey on graphs with polynomial growth
• On computing the connectivities of graphs and digraphs
• Properties of graphs with polynomial growth

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)