Generalized 3-(edge)-connectivity for undirected double-loop networks

DOI10.1080/09720529.2013.867672zbMath1348.05116OpenAlexW2050480340MaRDI QIDQ2831803

Yuefang Sun

Publication date: 3 November 2016

Published in: Journal of Discrete Mathematical Sciences and Cryptography (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/09720529.2013.867672

zbMATH Keywords

generalized 3-connectivitygeneralized 3-edge-connectivityundirected double-loop networks

Mathematics Subject Classification ID

Connectivity (05C40)

Related Items (4)

On the maximum and minimum sizes of a graph with given \(k\)-connectivity ⋮ Sharp upper bounds for generalized edge-connectivity of product graphs ⋮ A sharp lower bound for the generalized 3-edge-connectivity of strong product graphs ⋮ On the difference of two generalized connectivities of a graph

Cites Work

• Sharp bounds for the generalized connectivity \(\kappa _{3}(G)\)
• Hamiltonian decomposition of Cayley graphs of degree 4
• On the generalized (edge-)connectivity of graphs
• A SURVEY ON UNDIRECTED CIRCULANT GRAPHS
• Circulants and their connectivities

This page was built for publication: Generalized 3-(edge)-connectivity for undirected double-loop networks