Generalized 3-(edge)-connectivity for undirected double-loop networks
From MaRDI portal
Publication:2831803
DOI10.1080/09720529.2013.867672zbMath1348.05116OpenAlexW2050480340MaRDI QIDQ2831803
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
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
This page was built for publication: Generalized 3-(edge)-connectivity for undirected double-loop networks