English

Resistance distance in $k$-coalescence of certain graphs

Combinatorics 2023-09-07 v1

Abstract

Any graph can be considered as a network of resistors, each of which has a resistance of 1Ω.1 \Omega. The resistance distance rijr_{ij} between a pair of vertices ii and jj in a graph is defined as the effective resistance between ii and jj. This article deals with the resistance distance in the kk-coalescence of complete graphs. We also present its results in connection with the Kemeny's constant, Kirchhoff index, additive degree-Kirchhoff index, multiplicative degree-Kirchhoff index and mixed degree-Kirchhoff index. Moreover, we obtain the resistance distance in the kk-coalescence of a complete graph with particular graphs. As an application, we provide the resistance distance of certain graphs such as the vertex coalescence of a complete bipartite graph with a complete graph, a complete bipartite graph with a star graph, the windmill graph, pineapple graph, etc.

Keywords

Cite

@article{arxiv.2309.02704,
  title  = {Resistance distance in $k$-coalescence of certain graphs},
  author = {Haritha T and Chithra A},
  journal= {arXiv preprint arXiv:2309.02704},
  year   = {2023}
}