On Spectral Properties of Lanzhou Matrix of Graphs
Combinatorics
2025-12-23 v1
Abstract
Let be a simple graph on vertices. Lanzhou index is defined as In this manuscript, the Lanzhou matrix, denoted by , has been defined, and its spectral properties are studied. The entry in is if and are adjacent. Otherwise, the entry is zero. Some bounds on Lanzhou energy and spread on the Lanzhou matrix are obtained. Also, Lanzhou eigenvalues and inertia for some standard graphs have been obtained. Additionally, characterizations for the symmetricity of Lanzhou eigenvalues about the origin are obtained.
Cite
@article{arxiv.2512.19404,
title = {On Spectral Properties of Lanzhou Matrix of Graphs},
author = {Madhumitha K and Harshitha A and Swati Nayak and Sabitha D'Souza},
journal= {arXiv preprint arXiv:2512.19404},
year = {2025}
}