<abstract xmlns="http://www.w3.org/1999/xhtml"><p>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.</p></abstract>

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.

Recognition of split-graphic sequences

University of Kashmir Hazratbal Srinagar-190006, India

Eötvös Loránd University Faculty of Informatics, H-1011 Budapest, Pázmány s. 1/A, Hungary

Acta Universitatis Sapientiae, Informatica

This work is licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 3.0 License.

{"article-title":"Recognition of split-graphic sequences"}

Using different definitions of split graphs we propose quick algorithms for the recognition and extremal reconstruction of split sequences among integer,...

Recognition of split-graphic sequences

Data publikacji: 27 sty 2015

Zakres stron: 252 - 286

Otrzymano: 20 lip 2014

DOI: https://doi.org/10.1515/ausi-2015-0007

© 2015

This work is licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 3.0 License.