EMIS ELibM Electronic Journals PUBLICATIONS DE L'INSTITUT MATHÉMATIQUE (BEOGRAD) (N.S.)
Vol. 50(64) Preimenovati datoteke, proveriti paginaciju!!!, pp. 33--38 (1991)

Previous Article

Next Article

Contents of this Issue

Other Issues

ELibM Journals

ELibM Home

EMIS Home

 		 

A property of canonical graphs

Aleksandar Torga{\sh}ev

Matematicki fakultet, Beograd, Yugoslavia

Abstract: A finite connected graph is called canonical if no two of its vertices have the same neighbours. In this paper we prove that in all but a sequence of exceptional cases, deleting of a suitable chosen vertex in a canonical graph also gives a connected canonical graph. This property can have applications in various hereditary problems in the spectral Theory of Graphs.

Classification (MSC2000): 05C99

Full text of the article:

Electronic fulltext finalized on: 2 Nov 2001. This page was last modified: 16 Nov 2001.

© 2001 Mathematical Institute of the Serbian Academy of Science and Arts
© 2001 ELibM for the EMIS Electronic Edition