Ara
Toplam kayıt 3, listelenen: 1-3
Stronger reconstruction of distance-hereditary graphs
(Işık University Press, 2021)
A graph is said to be set-reconstructible if it is uniquely determined up to isomorphism from the set S of its non-isomorphic one-vertex deleted unlabeled subgraphs. Harary’s conjecture asserts that every finite simple ...
Both a graph and its complement are self-centered with identical radius
(Işık University Press, 2021)
We show that a graph and its complement are self-centered with identical radius r only when r = 2. Further, we provide a construction of such a graph for any given order at least eight.
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 ...