EMIS ELibM Electronic Journals PUBLICATIONS DE L'INSTITUT MATHÉMATIQUE (BEOGRAD) (N.S.)
Vol. 29(43), pp. 49--52 (1981)

Previous Article

Next Article

Contents of this Issue

Other Issues

ELibM Journals

ELibM Home

EMIS Home

 		 

A NEW SPECTRAL METHOD FOR DETERMINING THE NUMBER OF SPANNING TREES

D. M. Cvetkovi\'c and I. Gutman

Elektrotehnicki fakultet, Beograd, Yugoslavia and Prirodno-matematicki fakultet, Kragujevac, Yugoslavia

Abstract: As is known, the number of spanning tress of a regular graph can be determined by the graph spectrum. In this paper we describe a new variant of the spectral method for determining the number of spanning trees, which enables to solve the problem for a class of non-regular graphs.

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