Vulnerability parameters of split graphs
From MaRDI portal
Publication:5438691
DOI10.1080/00207160701365721zbMath1130.05033MaRDI QIDQ5438691
Yin-Kui Li, Qilong Zhang, Sheng Gui Zhang
Publication date: 28 January 2008
Published in: International Journal of Computer Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/00207160701365721
05C40: Connectivity
Related Items
ISOLATED SCATTERING NUMBER OF SPLIT GRAPHS AND GRAPH PRODUCTS, On the computational complexity of vertex integrity and component order connectivity, Vulnerability of super connected split graphs and bisplit graphs, Edge vulnerability parameters of bisplit graphs, Toughness of the corona of two graphs
Cites Work
- Unnamed Item
- Unnamed Item
- On a class of posets and the corresponding comparability graphs
- The toughness of split graphs
- A combinatorial algorithm minimizing submodular functions in strongly polynomial time.
- Tough graphs and Hamiltonian circuits.
- Computing the Scattering Number of Graphs
- Rupture degree of graphs