English

A study on $k$-coalescence of two graphs

Combinatorics 2024-03-11 v2

Abstract

The kk-coalescence of two graphs is obtained by merging a kk-clique of each graph. The AαA_\alpha-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 kk-coalescence of two graphs. Also, we derive the AαA_\alpha-characteristic polynomial of kk-coalescence of two graphs and then compute the AαA_\alpha-spectra of kk-coalescence of two complete graphs. In addition, we estimate the AαA_\alpha-energy of kk-coalescence of two complete graphs. Furthermore, we obtain some topological indices of vertex coalescence of two graphs, and as an application, we determine some indices of some family of graphs. From these results, we calculate the Wiener index, hyper-Wiener index etc. of the organic compound 1,2-dicyclohexylethane(\ce{C_{14}H_{26}}).

Keywords

Cite

@article{arxiv.2303.14915,
  title  = {A study on $k$-coalescence of two graphs},
  author = {Najiya V K and Chithra A},
  journal= {arXiv preprint arXiv:2303.14915},
  year   = {2024}
}
R2 v1 2026-06-28T09:34:44.207Z