2021/07/21 by Hany Ibrahim, Ibrahim, Hany
Computer Science · #05C17 #05C75 #Advanced Graph Theory Research #Combinatorics (math.CO) #FOS: Mathematics #G.2.2 #Graph Labeling and Dimension Problems #Interconnection Networks and Systems
paper · pdf · doi:10.48550/arxiv.2107.10660
openalex publication_date 2021/07/21 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
We introduce a characterization for split graphs by using edge contraction. Then, we use it to prove that any (2K2, claw)-free graph with α(G) ≥ 3 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.