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 ...
Edge-vertex domination and total edge domination in trees
(Işık University Press, 2021)
An edge e is an element of E(G) dominates a vertex v is an element of V (G) if e is incident with v or e is incident with a vertex adjacent to v. An edge-vertex dominating set of a graph G is a set D of edges of G such ...