A graph is Laplacian integral if the spectrum of its Laplacian matrix consists entirely of integers. We consider the class of constructably Laplacian integral graphs -those graphs that be constructed from an empty graph by adding a sequence of edges in such a way that each time a new edge is added,
Construction of integral graphs
โ Scribed by Wang Ligong; Li Xueliang; Zhang Shenggui
- Book ID
- 107500443
- Publisher
- SP Editorial Committee of Applied Mathematics - A Journal of Chinese Universities
- Year
- 2000
- Tongue
- English
- Weight
- 369 KB
- Volume
- 15
- Category
- Article
- ISSN
- 1005-1031
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
Suppose D is a subset of all positive integers. The distance graph G(Z, D) with distance set D is the graph with vertex set Z, and two vertices x and y are adjacent if and only if |x -y| โ D. This paper studies the chromatic number ฯ(Z, D) of G(Z, D). In particular, we prove that ฯ(Z, D) โค |D| + 1 w
In this article, we characterize all signless Laplacian integral graphs (here called Q -integral graphs) in the following classes: complete split graphs, multiple complete split-like graphs, extended complete split-like graphs, multiple extended split-like graphs. All these graphs were defined by Ha