Resistance distance in -coalescence of certain graphs
arXiv:2309.02704
Abstract
Any graph can be considered as a network of resistors, each of which has a resistance of The resistance distance between a pair of vertices and in a graph is defined as the effective resistance between and . This article deals with the resistance distance in the -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 -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.