Table of Contents
Fetching ...

On distance integral and distance Laplacian integral graphs

S. Pirzada, Ummer Mushtaq, Leonardo de Lima

Abstract

Let $G$ be a connected graph on $n$ vertices and let $D(G)$ and $D^{L}(G)$ be the distance and the distance Laplacian matrices associated with $G$. A graph $G$ is said to be $D$-integral (resp. $D^L$-integral) if all eigenvalues of $D(G)$ (resp. $D^L(G)$) are integers. In this paper, we obtain various conditions under which the graphs $a\overline{K_m}\nabla C_n$ and $K_{p,p}\nabla C_n$ are distance integral. We also obtain conditions on $m$, $n$ under which the dumbbell graph $\boldsymbol{DB}(W_{m,n})$ is $D^L$-integral.

On distance integral and distance Laplacian integral graphs

Abstract

Let be a connected graph on vertices and let and be the distance and the distance Laplacian matrices associated with . A graph is said to be -integral (resp. -integral) if all eigenvalues of (resp. ) are integers. In this paper, we obtain various conditions under which the graphs and are distance integral. We also obtain conditions on , under which the dumbbell graph is -integral.
Paper Structure (3 sections, 13 theorems, 23 equations)

This paper contains 3 sections, 13 theorems, 23 equations.

Key Result

Lemma 2.1

16 The adjacency spectrum of the cycle $C_n$ is

Theorems & Definitions (19)

  • Lemma 2.1
  • Lemma 2.2
  • Lemma 2.3
  • Lemma 2.4
  • proof
  • Lemma 2.5
  • proof
  • Theorem 2.6
  • proof
  • Theorem 2.7
  • ...and 9 more