Simple factor graphs associated with split graphs

Abstract

We introduce and study a loopless multigraph associated with a split graph $S$: the factor graph of $S$, denoted by $\hat{I}¦(S)$, which encodes the combinatorial information about 2-switch transformations over $S$. This construction provides a cleaner, compact and non-redundant alternative to the graph $A_4(S)$ by Barrus and West, for the particular case of split graphs. If $\hat{I}¦(S)$ is simple and connected, we obtain a precise description of the underlying structure of $S$, particularly when $\hat{I}¦(S)$ is complete, highlighting the usefulness of the factor graph for understanding 2-switch dynamics in balanced and indecomposable split graphs, as well as its 2-switch-degree classification.