Geodesic
The characterization of hereditary unigraphs on the canonical decomposition theory base
Trudy Instituta matematiki, Tome 20 (2012) no. 2, pp. 93-102

Voir la notice de l'article provenant de la source Math-Net.Ru

Considered the class of hereditary unigraphs. A graph determined up to isomorphism by its degree sequence is called a unigraph. A graph is called a hereditary unigraph if all its vertex induced subgraphs is a unigraphs. It is known that not all unigraphs are hereditary. It this paper the characterization of hereditary unigraphs on the canonical decomposition base is performed and a scheme of a linear algorithm that recognizes the property "to be a hereditary unigraph" is proposed. 
@article{TIMB_2012_20_2_a9,
     author = {R. A. Petrovich},
     title = {The characterization of hereditary unigraphs on the canonical decomposition theory base},
     journal = {Trudy Instituta matematiki},
     pages = {93--102},
     publisher = {mathdoc},
     volume = {20},
     number = {2},
     year = {2012},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/TIMB_2012_20_2_a9/}
}
TY  - JOUR
AU  - R. A. Petrovich
TI  - The characterization of hereditary unigraphs on the canonical decomposition theory base
JO  - Trudy Instituta matematiki
PY  - 2012
SP  - 93
EP  - 102
VL  - 20
IS  - 2
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/TIMB_2012_20_2_a9/
LA  - ru
ID  - TIMB_2012_20_2_a9
ER  - 
%0 Journal Article
%A R. A. Petrovich
%T The characterization of hereditary unigraphs on the canonical decomposition theory base
%J Trudy Instituta matematiki
%D 2012
%P 93-102
%V 20
%N 2
%I mathdoc
%U http://geodesic.mathdoc.fr/item/TIMB_2012_20_2_a9/
%G ru
%F TIMB_2012_20_2_a9
R. A. Petrovich. The characterization of hereditary unigraphs on the canonical decomposition theory base. Trudy Instituta matematiki, Tome 20 (2012) no. 2, pp. 93-102. http://geodesic.mathdoc.fr/item/TIMB_2012_20_2_a9/