On marker set distance Laplacian eigenvalues in graphs.

Medha Itagi Huilgol 1 * and S. Anuradha 2

doi:10.26637/MJM0602/0011

On marker set distance Laplacian eigenvalues in graphs.

Authors :

Medha Itagi Huilgol^{1 *} and S. Anuradha ²

Author Address :

^1,2Department of Mathematics, Bangalore University, Central Campus, Bengaluru- 560 001, India.

*Corresponding author.

Abstract :

In our previous paper, we had introduced the marker set distance matrix and its eigenvalues. In this paper, we extend them naturally to the Laplacian eigenvalues. To define the Laplacian, we have defined the distance degree sequence of the marker set in the graph. Here we have considered the study of the Laplacian matrix, its characteristic polynomial and related results.

Keywords :

Marker set of a graph, $ M$-set distance matrix, $M$-set distance Laplacian, characteristic polynomial, eigenvalues.

DOI :

10.26637/MJM0602/0011

Article Info :

Received : October 07, 2017; Accepted : January 30, 2018.