Characterizations for split graphs and unbalanced split graphs

MaRDI QIDQ6373489zbMATH OpenFDO

Authors H. Ibrahim

Publication date 20 July 2021

Mathematics Subject Classification ID

Perfect graphs (05C17) Structural characterization of families of graphs (05C75)

Abstract: We introduce a characterization for split graphs by using edge contraction. Then, we use it to prove that any ($2K_2$, claw)-free graph with $alpha(G)geq3$ is a split graph. Also, we apply it to characterize any pseudo-split graph. Finally, by using edge contraction again, we characterize unbalanced split graphs which we use to characterize the Nordhaus-Gaddum graphs.

This page was built for publication: Characterizations for split graphs and unbalanced split graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6373489)