Using multiplicities of eigenvalues of elliptic self-adjoint differential operators on graphs and transversality, we construct some new invariants of graphs which are related to tree-width.
Eigenvalues of matrices with tree graphs
β Scribed by Clark Jeffries; P. van den Driessche
- Publisher
- Elsevier Science
- Year
- 1988
- Tongue
- English
- Weight
- 827 KB
- Volume
- 101
- Category
- Article
- ISSN
- 0024-3795
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
## Abstract In this paper, we investigate graphs for which the corresponding Laplacian matrix has distinct integer eigenvalues. We define the set __S~i,n~__ to be the set of all integers from 0 to __n__, excluding __i__. If there exists a graph whose Laplacian matrix has this set as its eigenvalues
We study nonregular graphs with three eigenvalues. We determine all the ones with least eigenvalue &2, and give new infinite families of examples. 1998 Academic Press ## 1. Introduction In this paper we look at the graphs that are generalizations of strongly regular graphs (cf. [3, 6, 16]) by drop
## Abstract The number of distinct eigenvalues of the adjacency matrix of a graph is bounded below by the diameter of the graph plus one. Many graphs that achieve this lower bound exhibit much symmetry, for example, distanceβtransitive and distanceβregular graphs. Here we provide a recursive constr