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 polynomial 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 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(C14H26).

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…