Have a personal or library account? Click to login

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.

Language: English
Page range: 252 - 286
Submitted on: Jul 20, 2014
Published on: Jan 27, 2015
Published by: Sapientia Hungarian University of Transylvania
In partnership with: Paradigm Publishing Services
Publication frequency: 2 times per year

© 2015 Bilal A. Chat, Shariefudddin Pirzada, Antal Iványi, published by Sapientia Hungarian University of Transylvania
This work is licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 3.0 License.