Ara
Toplam kayıt 2, listelenen: 1-2
Reciprocal version of product degree distance of cactus graphs
(Işık University Press, 2021)
The reciprocal version of product degree distance is a product degree weighted version of Harary index defined for a connected graph G as RDD*(G) = Sigma({x, y}subset of V(G) )(d(G)(x).d(G)(y))/d(G)(x,y), where d(G)(x) is ...
Bounds on hyper-status connectivity index of graphs
(Işık University Press, 2021)
In this paper, we obtain the bounds for the hyper-status connectivity indices of a connected graph and its complement in terms of other graph invariants. In addition, the hyper-status connectivity indices of some composite ...