On the superconnectivity and the conditional diameter of graphs and digraphs
From MaRDI portal
Publication:2766102
DOI<link itemprop=identifier href="https://doi.org/10.1002/(SICI)1097-0037(199910)34:3<197::AID-NET4>3.0.CO;2-9" /><197::AID-NET4>3.0.CO;2-9 10.1002/(SICI)1097-0037(199910)34:3<197::AID-NET4>3.0.CO;2-9zbMath0984.05052OpenAlexW2032599964MaRDI QIDQ2766102
No author found.
Publication date: 27 January 2002
Full work available at URL: https://doi.org/10.1002/(sici)1097-0037(199910)34:3<197::aid-net4>3.0.co;2-9
Related Items (2)
Maximally edge-connected and vertex-connected graphs and digraphs: A survey ⋮ The \((\alpha ,\beta ,s,t)\)-diameter of graphs: a particular case of conditional diameter
Cites Work
This page was built for publication: On the superconnectivity and the conditional diameter of graphs and digraphs
