The generalized distance spectra of the M-join of graphs
Abstract
In this paper, we obtain the generalized distance spectra of the graphs constructed by 19 unary and 21 binary graph operations of M-join type when the constituting graphs satisfy some conditions. Also, we deduce a result on the generalized distance spectrum of the double graph of a connected regular graph in the literature. As applications, we construct infinite families of generalized distance cospectral graphs. Also, we construct infinite families of distance (distance Laplacian, distance signless Laplacian) integral graphs.
Copyright (c) 2024 G. Kalaivani, Rajkumar Rajendran
This work is licensed under a Creative Commons Attribution 4.0 International License.
The authors retain all rights to the original work without any restrictions.
License for Published Contents
"Le Matematiche" published articlesa are distribuited with Creative Commons Attribution 4.0 International. You are free to copy, distribute and transmit the work, and to adapt the work. You must attribute the work in the manner specified by the author or licensor (but not in any way that suggests that they endorse you or your use of the work).
License for Metadata
"Le Matematiche" published articles metadata are dedicated to the public domain by waiving all publisher's rights to the work worldwide under copyright law, including all related and neighboring rights, to the extent allowed by law.
You can copy, modify, distribute and perform the work, even for commercial purposes, all without asking permission.
No Fee Charging
No fee is required to complete the submission/review/publishing process of authors paper.
