Recognition of split-graphic sequences

@inproceedings{Chat2015RecognitionOS,
  title={Recognition of split-graphic sequences},
  author={B. A. Chat and Shariefuddin Pirzada and Antal Iv{\'a}nyi},
  year={2015}
}
Using different definitions of split graphs we propose quick algorithms for the recognition and extremal reconstruction of split sequences among integer, regular, and graphic sequences. 1 Basic definitions In this paper a, b, l, m, n, p and q denote nonnegative integers with b ≥ a and l +m ≥ 1. We follow the terminology of Handbook of Graph Theory [28] written by Gross, Yellen and Zhang. An (a, b, n)-graph is a loopless graph in which different vertices are connected at least by a and at most… CONTINUE READING