Abstract
Unigraphs are graphs uniquely determined by their own degree sequence up to isomorphism. In this paper a structural description for unigraphs is introduced: vertex set is partitioned into three disjoint sets while edge set is divided into two different classes. This characterization allows us to design a linear time recognition algorithm that works recursively pruning the degree sequence of the graph. The algorithm detects two particular graphs whose superposition generates the given unigraph. © Springer-Verlag Berlin Heidelberg 2009.
Cite
CITATION STYLE
Borri, A., Calamoneri, T., & Petreschi, R. (2009). Recognition of unigraphs through superposition of graphs : Extended abstract. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5431 LNCS, pp. 165–176). https://doi.org/10.1007/978-3-642-00202-1_15
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
