On certain closeness spectra of one-point union of complete graphs Kn

Rajkumar  Vaishnavi; Rajkumar  Vaishnavi; Sathish Krishnan

doi:10.5269/bspm.79589

Auteurs-es

Rajkumar Vaishnavi SRM Institute of Science and Technology
Rajkumar Vaishnavi SRM Institute of Science and Technology
Sathish Krishnan SRM Institute of Science and Technology

DOI :

https://doi.org/10.5269/bspm.79589

Résumé

The closeness eigenvalues of a graph G are the eigenvalues of its closeness matrix. The closeness spectrum of a graph G is the set of closeness eigenvalues with their multiplicities. In this paper the closeness spectra, closeness Laplacian spectra and closeness Q-Laplacian spectra of one-point union of m copies of complete graphs on n vertices are computed.

Biographies de l'auteur-e

Rajkumar Vaishnavi, SRM Institute of Science and Technology

R. Vaishnavi is a research scholar in the Department of Mathematics and Statistics, Faculty of Science and Humanities, SRM Institute of Science and Technology, Kattankulathur, India. Her research interests include spectral graph theory and distance-based graph invariants.
Rajkumar Vaishnavi, SRM Institute of Science and Technology

R. Vaishnavi is a research scholar in the Department of Mathematics and Statistics, Faculty of Science and Humanities, SRM Institute of Science and Technology, Kattankulathur, India. Her research interests include spectral graph theory and distance-based graph invariants.

Références

Mathematics Subject Classification (2020): 05C50, 05C12, 05C82
Keywords: Closeness matrix; Closeness eigenvalues; Closeness Laplacian; Closeness Q-Laplacian; Graph spectra; Spectral graph theory
Article Type: Research Article
Field: Graph Theory / Spectral Graph Theory