scientific article; zbMATH DE number 961975
From MaRDI portal
Publication:5689821
DOI<97::AID-NET3>3.0.CO;2-7 10.1002/(SICI)1097-0037(199609)28:2<97::AID-NET3>3.0.CO;2-7zbMath0865.90047MaRDI QIDQ5689821
No author found.
Publication date: 6 July 1997
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Programming involving graphs or networks (90C35) Communication networks in operations research (90B18)
Related Items (17)
Superconnected digraphs and graphs with small conditional diameters ⋮ On the Laplacian Eigenvalues and Metric Parameters of Hypergraphs ⋮ The alternating polynomials and their relation with the spectra and conditional diameters of graphs ⋮ Maximally edge-connected and vertex-connected graphs and digraphs: A survey ⋮ Conditional diameter saturated graphs ⋮ Diameter and connectivity of (D; g)-cages ⋮ On the connectivity and superconnected graphs with small diameter ⋮ Unnamed Item ⋮ Connectedness of digraphs and graphs under constraints on the conditional diameter ⋮ A new bound for the connectivity of cages ⋮ On the connectivity of semiregular cages ⋮ The \((\alpha ,\beta ,s,t)\)-diameter of graphs: a particular case of conditional diameter ⋮ The alternating and adjacency polynomials, and their relation with the spectra and diameters of graphs ⋮ Degree sequence conditions for maximally edge-connected oriented graphs ⋮ Sufficient conditions for \(\lambda ^{\prime}\)-optimality of graphs with small conditional diameter ⋮ Improved lower bound for the vertex connectivity of \((\delta ;g)\)-cages ⋮ Eigenvalue interlacing and weight parameters of graphs
This page was built for publication: