EMIS ELibM Electronic Journals PUBLICATIONS DE L'INSTITUT MATHÉMATIQUE (BEOGRAD) (N.S.)
Vol. 44(58), pp. 29--34 (1988)

Previous Article

Next Article

Contents of this Issue

Other Issues

ELibM Journals

ELibM Home

EMIS Home

 		 

ON CONNECTED GRAPHS WITH MAXIMAL INDEX

D. Cvetkovi\'c and P. Rowlinson

Elektrotehnicki fakultet, Beograd, Yugoslavia and Department of Mathematics, University of Stirling, Scotland FK94LA

Abstract: Let ${\Cal H}(n,n+k)$ denote the set of all connected graps having $n$ vertices and $n+k$ edges ($k\geq 0$). The graphs in ${\Cal H}(n,n+k)$ with maximal index are determined (i) for certain small values of $n$ and $k$, (ii) for arbitrary fixed $k$ and large enough $n$. The results include a proof of a conjecture of Brualdi and Solheid [1].

Classification (MSC2000): 05C50

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