Resistance distances in corona and neighborhood corona networks based on Laplacian generalized inverse approach

Let [Formula: see text] and [Formula: see text] be two graphs on disjoint sets of [Formula: see text] and [Formula: see text] vertices, respectively. The corona of graphs [Formula: see text] and [Formula: see text], denoted by [Formula: see text], is the graph formed from one copy of [Formula: see text] and [Formula: see text] copies of [Formula: see text] where the [Formula: see text]th vertex of [Formula: see text] is adjacent to every vertex in the [Formula: see text]th copy of [Formula: see text]. The neighborhood corona of [Formula: see text] and [Formula: see text], denoted by [Formula: see text], is the graph obtained by taking one copy of [Formula: see text] and [Formula: see text] copies of [Formula: see text] and joining every neighbor of the [Formula: see text]th vertex of [Formula: see text] to every vertex in the [Formula: see text]th copy of [Formula: see text] by a new edge. In this paper, the Laplacian generalized inverse for the graphs [Formula: see text] and [Formula: see text] is investigated, based on which the resistance distances of any two vertices in [Formula: see text] and [Formula: see text] can be obtained. Moreover, some examples as applications are presented, which illustrate the correction and efficiency of the proposed method.

[1]  Shaohui Wang,et al.  On extremal multiplicative Zagreb indices of trees with given number of vertices of maximum degree , 2017, Discret. Appl. Math..

[2]  Heping Zhang,et al.  Some rules on resistance distance with applications , 2008 .

[3]  Jinde Cao,et al.  A note on ‘some physical and chemical indices of clique-inserted lattices’ , 2014 .

[4]  Dong Li,et al.  Complete characterization of bicyclic graphs with minimal Kirchhoff index , 2016, Discret. Appl. Math..

[5]  Changjiang Bu,et al.  Some results on resistance distances and resistance matrices , 2015 .

[6]  Shaohui Wang,et al.  Sharp upper bounds for multiplicative Zagreb indices of bipartite graphs with given diameter , 2017, Discret. Appl. Math..

[7]  Xiaogang Liu,et al.  Spectra of subdivision-vertex and subdivision-edge neighbourhood coronae , 2012, 1212.0851.

[8]  Jia-Bao Liu,et al.  Minimizing Kirchhoff index among graphs with a given vertex bipartiteness , 2016, Appl. Math. Comput..

[9]  Uppaluri S. R. Murty,et al.  Graph Theory with Applications , 1978 .

[10]  Cam McLeman,et al.  Spectra of coronae , 2011, 1111.1200.

[11]  Douglas J. Klein,et al.  Comparison theorems on resistance distances and Kirchhoff indices of S, T -isomers , 2014 .

[12]  Weijun Liu,et al.  Further results regarding the degree Kirchhoff index of graphs , 2014 .

[13]  Douglas J. Klein,et al.  A recursion formula for resistance distances and its applications , 2013, Discret. Appl. Math..

[14]  Zuhe Zhang,et al.  Some physical and chemical indices of clique-inserted lattices , 2013, 1302.5932.

[15]  Changjiang Bu,et al.  Resistance distance in subdivision-vertex join and subdivision-edge join of graphs , 2014 .

[16]  Jinde Cao,et al.  The resistance distances of electrical networks based on Laplacian generalized inverse , 2015, Neurocomputing.

[17]  Lihua Feng,et al.  A note on the Kirchhoff index of bicyclic graphs , 2014, Ars Comb..

[18]  Jia-Bao Liu,et al.  The {1}-inverse of the Laplacian of subdivision-vertex and subdivision-edge coronae with applications , 2017 .

[19]  Kinkar Chandra Das,et al.  Ordering connected graphs by their Kirchhoff indices , 2016, Int. J. Comput. Math..

[20]  Kinkar Chandra Das,et al.  Some extremal graphs with respect to inverse degree , 2016, Discret. Appl. Math..

[21]  Yujun Yang.  The Kirchhoff index of subdivisions of graphs , 2014, Discret. Appl. Math..