EMIS ELibM Electronic Journals PUBLICATIONS DE L'INSTITUT MATHÉMATIQUE (BEOGRAD) (N.S.)
Vol. 33(47), pp. 227--234 (1983)

Previous Article

Next Article

Contents of this Issue

Other Issues

ELibM Journals

ELibM Home

EMIS Home

 		 

FINITENESS OF SPECTRA OF GRAPHS OBTAINED BY SOME OPERATIONS ON INFINITE GRAPHS

Aleksandar Torgasev

Matematicki fakultet, Beograd, Yugoslavia

Abstract: In this paper we consider some unary and binary operations on infinite graphs, and we investigate when the spectrum of the resulting graph is finite. \par In particular, we consider the induced subgraphs of an infinite graph, relabeling of its vertices, the complementary graph, the union, Cartesian product, complete product and direct sum of two infinite graphs, the line graph and the total graph of a graph. \par For some of these operations we find that the spectrum of the graph so obtained is always infinite (direct sum, line and total graph). Among other things, we show that finiteness of the spectrum of an infinite graph does not change by any relabeling of its vertices.

Keywords: Connected infinite graph, operation on infinite graphs, spectrum of a graph, finiteness of the spectrum

Classification (MSC2000): 05C50; 47A65

Full text of the article:

Electronic fulltext finalized on: 3 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