The Spectral Radius of the Reciprocal Distance Laplacian Matrix of a Graph

Authors

Ravindra Bapat, Indian Statistical Institute (Delhi Centre)
Swarup Kumar Panda, Indian Statistical Institute (Delhi Centre)

Article Type

Research Article

Publication Title

Bulletin of the Iranian Mathematical Society

Abstract

In this article, we introduce a Laplacian for the reciprocal distance matrix of a connected graph, called the reciprocal distance Laplacian. Let δ1≥ δ2≥ ⋯ ≥ δn-1≥ δn be the reciprocal distance Laplacian spectrum. In this short note, we show that δ1≤ n with equality if and only if the complement graph G¯ of G is disconnected.

First Page

1211

Last Page

1216

DOI

10.1007/s41980-018-0084-z

Publication Date

10-1-2018

Recommended Citation

Bapat, Ravindra and Panda, Swarup Kumar, "The Spectral Radius of the Reciprocal Distance Laplacian Matrix of a Graph" (2018). Journal Articles. 1206.
https://digitalcommons.isical.ac.in/journal-articles/1206