Vulnerability parameters of split graphs

DOI10.1080/00207160701365721zbMath1130.05033OpenAlexW2116553019MaRDI 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

zbMATH Keywords

split graphsubmodular functiontenacityintegrityscattering numberrupture degree

Mathematics Subject Classification ID

Connectivity (05C40)

Related Items (9)

Toughness of the corona of two graphs ⋮ Parameterized Complexity of Safe Set ⋮ ISOLATED SCATTERING NUMBER OF SPLIT GRAPHS AND GRAPH PRODUCTS ⋮ A complete characterization of bidegreed split graphs with four distinct signless Laplacian eigenvalues ⋮ On the computational complexity of vertex integrity and component order connectivity ⋮ Edge vulnerability parameters of bisplit graphs ⋮ Vulnerability of super connected split graphs and bisplit graphs ⋮ Unnamed Item ⋮ Maximally and super connected multisplit graphs and digraphs

Cites Work

• 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.
• Scattering number in graphs
• Computing the Scattering Number of Graphs
• Rupture degree of graphs
• Unnamed Item

This page was built for publication: Vulnerability parameters of split graphs