A study on k-coalescence of two graphs

Authors

  • V. K. Najiya National Institute Of Technology, India
  • A. V. Chithra National Institute Of Technology, India

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.

 

Author Biography

  • V. K. Najiya, National Institute Of Technology, India

     

     

Downloads

Published

2024-02-12

Issue

Section

Articoli