Indices of Trees with a Prescribed Diameter

@inproceedings{Simic2007IndicesOT,
  title={Indices of Trees with a Prescribed Diameter},
  author={Slobodan K. Simic and Bo Zhou},
  year={2007}
}
Let G = (V (G), E(G)) be a simple graph, and let A be its adjacency matrix. The characteristic polynomial det(xI −A) of A is called the characteristic polynomial of G, and is denoted by φ(G, x). The eigenvalues of A (i.e. the zeros φ(G, x)) are called the eigenvalues of G. The index of a graph G is the largest eigenvalue of G, denoted by ρ(G). It has been studied extensively in the literature [1, 3]; see also [2]. In the class of all trees with n ≥ 6 vertices, M. Hofmeister [7] determined the… CONTINUE READING

Citations

Publications citing this paper.

References

Publications referenced by this paper.
Showing 1-10 of 14 references

On the spectral radius of trees with the given diameter d

  • S. Tan, J. Guo, J. Qi
  • Chinese Quart. J. Math., 19 (2004) 57–62…
  • 2007
1 Excerpt

Variable neighbourhood search for extremal graphs 3. On the largest eigenvalue of color-constrained trees

  • D. Cvetković, S. Simić, G. Caporossi, P. Hansen
  • Linear and Multilinear Algebra,
  • 2001
1 Excerpt

Feng : On the largest eigenvalue of a graph

  • Q. K.
  • Linear Algebra Appl .
  • 1997

On the two largest eigenvalues of trees

  • M. Hofmeister
  • Linear Algebra Appl.,
  • 1997
1 Excerpt

Spectra of Graphs, 3rd edition

  • D. Cvetković, M. Doob, H. Sachs
  • Johann Ambrosius Barth, Heidelberg,
  • 1995
3 Excerpts

Rowlinson : The largest eigenvalue of a graph : A survey

  • P. D. Cvetković
  • Linear and Multilinear Algebra
  • 1990

The largest eigenvalue of a graph: A survey

  • D. Cvetković, P. Rowlinson
  • Linear and Multilinear Algebra,
  • 1990
1 Excerpt

Simić: On the largest eigenvalue of unicyclic graphs

  • S K.
  • Publ. Inst. Math. (Beograd),
  • 1987
1 Excerpt

Pelikan : On the eigenvalues of trees

  • J. L. Lovász
  • Acta Math . Appl . Sinica
  • 1979

Similar Papers

Loading similar papers…