Corrections to classical results on Independence and Covering numbers of the Splitting graph
J. Castro, J. Lea\~nos, O. Rosario

TL;DR
This paper revises classical formulas relating independence and cover numbers of splitting graphs to those of original graphs, correcting longstanding errors and clarifying the conditions for their validity.
Contribution
It identifies errors in previous results on splitting graph invariants, provides corrected formulas, and characterizes when original formulas hold or fail.
Findings
Counterexamples disproving classical equalities
Corrected formulas for independence and cover numbers
Characterization of cases where original results are valid
Abstract
The splitting graph of a finite simple graph was introduced by Sampathkumar and Walikar in 1980~\cite{SW1980} and has been extensively studied in relation to graph invariants of . In their original work, several formulas relating the independence number and the vertex cover number of to the corresponding parameters of were stated and subsequently cited in the literature. In this paper, we show that some of these classical equalities do not hold in general. We present explicit counterexamples disproving the published results concerning independence and vertex cover numbers of splitting graphs. Moreover, we establish the correct formulas and precisely characterize the cases in which the original statements are valid and those in which they fail. These results correct an error that has remained unnoticed for more than four decades and provide a clearer…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsGraph theory and applications · Advanced Graph Theory Research · Finite Group Theory Research
