Super Line-Connectivity Properties of Circulant Graphs

DOI10.1137/0607011zbMath0578.05046OpenAlexW1968998511MaRDI QIDQ3699725

No author found.

Publication date: 1986

Published in: SIAM Journal on Algebraic Discrete Methods (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/0607011

zbMATH Keywords

vulnerabilitycirculant graphsnetwork reliabilityHarary graphssuper edge connectivitylambda- graphline-connectivitysuper line connectivity

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Graph theory (05C99) Applications of graph theory to circuits and networks (94C15) Connectivity (05C40)

Related Items (15)

Do local majorities force a global majority? ⋮ On a kind of restricted edge connectivity of graphs ⋮ A bound on 4-restricted edge connectivity of graphs ⋮ On unreliability polynomials and graph connectivity in reliable network synthesis ⋮ Super link-connectivity of iterated line digraphs. ⋮ On optimizing edge connectivity of product graphs ⋮ Edge fault-tolerance analysis of maximally edge-connected graphs and super edge-connected graphs ⋮ Bound on \(m\)-restricted edge connectivity ⋮ On the number of spanning trees in directed circulant graphs ⋮ Maximally edge-connected and vertex-connected graphs and digraphs: A survey ⋮ Super edge-connectivity of dense digraphs and graphs ⋮ Vulnerability of super extra edge-connected graphs ⋮ Super edge connectivity properties of connected edge symmetric graphs ⋮ Connectivity of vertex and edge transitive graphs ⋮ On the construction of most reliable networks

Cites Work

• Minimale \(n\)-fach kantenzusammenhängende Graphen
• Circulants and their connectivities
• Combinatorial optimization problems in the analysis and design of probabilistic networks
• THE MAXIMUM CONNECTIVITY OF A GRAPH
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Super Line-Connectivity Properties of Circulant Graphs