In this article, we are interested in characterizing graphs with three distinct arithmetic–
geometric eigenvalues. We provide the bounds on the arithmetic–geometric energy of …

Let G be a connected graph with distance matrix D (G), and let T r (G) be the diagonal matrix
of vertex transmissions of G. For any α∈[0, 1], the D α-matrix of G is defined as D α (G)= α T r …

A complex unit gain graph is a graph where each orientation of an edge is given a complex
unit, which is the inverse of the complex unit assigned to the opposite orientation. In this …

The anti-adjacency matrix of a graph is constructed from the distance matrix of a graph by
keeping each row and each column only the largest distances. This matrix can be …

In the paper, we introduce the signless Laplacian ABC-matrix Q (G)= D (G)+ Ã (G), where D
(G) is the diagonal matrix of ABC-degrees and à (G) is the ABC-matrix of G. The eigenvalues …

Distance-regular graphs with a few q-distance eigenvalues - ScienceDirect Skip to main
contentSkip to article Elsevier logo Journals & Books Search RegisterSign in View PDF …

A cograph is a graph with no induced path on four vertices. The vicinal preorder on the
vertex set of a graph is defined in terms of inclusions among the neighborhoods of vertices …

For a connected graph G with order n and an integer k≥ 1, we denote by S k (D (G))= λ 1 (D
(G))+⋯+ λ k (D (G)) the sum of k largest distance eigenvalues of G. In this paper, we consider …

Two graphs are said to be D-cospectral if they have the same distance spectrum. A graph is
said to be determined by its distance spectrum if there is no other non-isomorphic graph D …

Full article: On graphs with three distinct signless Laplacian eigenvalues Skip to Main Content
Taylor and Francis Online homepage Taylor and Francis Online homepage Log in | Register …