Advanced Search

Query:

Fill in the form and click »Search«...

Format:

Display: entries per page entries

Zbl 0603.05028
Brualdi, Richard A.; Solheid, Ernie S.
On the spectral radius of connected graphs. (English)
[J] Publ. Inst. Math., Nouv. Sér. 39(53), 45-54 (1986). ISSN 0350-1302

The spectral radius of a graph is the largest eigenvalue of its adjacency matrix. The authors determine connected graphs with n vertices and e edges with maximum spectral radius when $e=n+s$ (0$\le s\le 5)$ and n sufficiently large. These graphs consist of pendant edges attached at a vertex of maximal degree of $G\sb s$ where $G\sb s$ in $K\sb 3$, $K\sb 4- e$, $K\sb 4$ for $s=0,1,2$ and $\overline{K\sb s\cup 2K\sb 1}$ for $s=3,4,5$.
[D.Cvetkovic]

MSC 2000:: *05C50 Graphs and matrices
05C35 Extremal problems (graph theory)

Keywords: sepctral radius

Comment on this Item PDF MathML XML ASCII DVI PS BibTeX Online Ordering Article Journal Journal

	Scientific prize winners of the ICM 2010
	Overhang
	Lie groups, physics and geometry. An introduction for physicists, engineers and chemists.

Advanced Search

Zentralblatt MATH Berlin [Germany]