A study on k-coalescence of two graphs
Abstract
The k-coalescence of two graphs is obtained by merging a k-clique of each graph. The Aα-matrix of a graph is the convex combination of its degree matrix and adjacency matrix. In this paper, we present some structural properties of a non-regular graph which is obtained from the k-coalescence of two graphs. Also, we derive the Aα-characteristic poly- nomial of k-coalescence of two graphs and then compute the Aα-spectra of k-coalescence of two complete graphs. In addition, we estimate the Aα-energy of k-coalescence of two complete graphs. Furthermore, we obtain some topological indices of vertex coalescence of two graphs, and as an application, we determine the Wiener, hyper-Wiener and Zagreb indices of Lollipop and Dumbbell graphs.
Downloads
Published
Issue
Section
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.