On certain closeness spectra of one-point union of complete graphs Kn
DOI:
https://doi.org/10.5269/bspm.79589Resumen
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.
Referencias
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
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
Descargas
Publicado
2026-06-05
Número
Sección
Research Articles
Licencia
Derechos de autor 2026 Boletim da Sociedade Paranaense de Matemática

Esta obra está bajo una licencia internacional Creative Commons Atribución 4.0.
When the manuscript is accepted for publication, the authors agree automatically to transfer the copyright to the (SPM).
The journal utilize the Creative Common Attribution (CC-BY 4.0).



