Recognition of Unigraphs through Superposition of Graphs (Extended Abstract)

Authors:
Alessandro Borri;Tiziana Calamoneri;Rossella Petreschi
Affiliations:
Department of Computer Science, Univ. of Rome "Sapienza" - Italy, Roma, Italy 00198;Department of Computer Science, Univ. of Rome "Sapienza" - Italy, Roma, Italy 00198;Department of Computer Science, Univ. of Rome "Sapienza" - Italy, Roma, Italy 00198
Venue:
WALCOM '09 Proceedings of the 3rd International Workshop on Algorithms and Computation
Year:
2009

Citing 4
Cited 2

Matroids arisen from matrogenic graphs

Proceedings of an international symposium on Graphs and combinatorics
Recognizing cographs and threshold graphs through a classification of their edges

Information Processing Letters
Decomposition of graphical sequences and unigraphs

Discrete Mathematics
λ-coloring matrogenic graphs

Discrete Applied Mathematics

L(2,1)-labeling of unigraphs

TAPAS'11 Proceedings of the First international ICST conference on Theory and practice of algorithms in (computer) systems
The L(2,1)-labeling of unigraphs

Discrete Applied Mathematics

Quantified Score

Hi-index	0.00

Visualization

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.