We introduce the mixed degree-Kirchhoff index, a new molecular descriptor defined by (Formula presented) where di is the degree of the vertex i and Rij is the effective resistance between vertices i and j. We give general upper and lower bounds for Ȓ(G) and show that, unlike other related descriptors, it attains its largest asymptotic value (order n4), among barbell graphs, for the highly asymmetric lollipop graph. We also give more refined lower (order n2) and upper (order n3) bounds for c-cyclic graphs in the cases 0 ≤ c ≤ 6. For this latter purpose we use a close relationship between our new mixed degree-Kirchhoff index and the inverse degree, prior bounds we found for the inverse degree of c-cyclic graphs, and suitable expressions for the largest and smallest effective resistances of c-cyclic graphs.
Bianchi, M., Cornaro, A., Palacios, J., Torriero, A. (2016). Upper and Lower Bounds for the Mixed Degree-Kirchhoff Index. FILOMAT, 30(9), 2351-2358 [10.2298/FIL1609351B].
Upper and Lower Bounds for the Mixed Degree-Kirchhoff Index
Cornaro, Alessandra
;
2016
Abstract
We introduce the mixed degree-Kirchhoff index, a new molecular descriptor defined by (Formula presented) where di is the degree of the vertex i and Rij is the effective resistance between vertices i and j. We give general upper and lower bounds for Ȓ(G) and show that, unlike other related descriptors, it attains its largest asymptotic value (order n4), among barbell graphs, for the highly asymmetric lollipop graph. We also give more refined lower (order n2) and upper (order n3) bounds for c-cyclic graphs in the cases 0 ≤ c ≤ 6. For this latter purpose we use a close relationship between our new mixed degree-Kirchhoff index and the inverse degree, prior bounds we found for the inverse degree of c-cyclic graphs, and suitable expressions for the largest and smallest effective resistances of c-cyclic graphs.I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.