✦ LIBER ✦

Bounds of eigenvalues of graphs

✍ Scribed by Yuan Hong

Publisher: Elsevier Science
Year: 1993
Tongue: English
Weight: 469 KB
Volume: 123
Category: Article
ISSN: 0012-365X
DOI: 10.1016/0012-365x(93)90007-g

No coin nor oath required. For personal study only.

✦ Synopsis

The eigenvalues of a graph are the eigenvalues of its adjacency matrix. This paper presents an algebraically defined invariant system of a graph. We get some bounds of the eigenvalues of graphs and propose a few open problems.

📜 SIMILAR VOLUMES

The performance of an eigenvalue bound o

The performance of an eigenvalue bound on the max-cut problem in some classes of graphs

✍ C. Delorme; S. Poljak 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 683 KB

Delorme, C. and S. Poljak, The performance of an eigenvalue bound on the max-cut problem in some classes of graphs, Discrete Mathematics 111 (1993) 145-156. The authors earlier introduced a number q(C), which gives a well-computable upper bound on the maximum bipartite subgraph of a graph or, more

Eigenvalues of finite graphs

✍ C. Delorme 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 642 KB

The distribution of eigenvalues of graph

The distribution of eigenvalues of graphs

✍ Dasong Cao; Hong Yuan 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 846 KB

Bounds on eigenvalues of finite element

Bounds on eigenvalues of finite element systems

✍ Jerry I. Lin 📂 Article 📅 1991 🏛 John Wiley and Sons 🌐 English ⚖ 642 KB

Bounds for eigenvalues of certain stocha

Bounds for eigenvalues of certain stochastic matrices

✍ H.J. Landau; A.M. Odlyzko 📂 Article 📅 1981 🏛 Elsevier Science 🌐 English ⚖ 525 KB

Bounds for eigenvalues of doubly stochas

Bounds for eigenvalues of doubly stochastic matrices

✍ Miroslav Fiedler 📂 Article 📅 1972 🏛 Elsevier Science 🌐 English ⚖ 507 KB