On distance integral and distance Laplacian integral graphs

Abstract

Let G be a connected graph on n vertices and let D(G) and DL(G) be the distance and the distance Laplacian matrices associated with G. A graph G is said to be D-integral (resp. DL-integral) if all eigenvalues of D(G) (resp. DL(G)) are integers. In this paper, we obtain various conditions under which the graphs aKm∇ Cn and Kp,p∇ Cn are distance integral. We also obtain conditions on m, n under which the dumbbell graph DB(Wm,n) is DL-integral.

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…