2 research outputs found

    Bounds on hyper-status connectivity index of graphs

    Get PDF
    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 graphs such as Cartesian product, join and composition of two connected graphs are obtained. We apply some of our results to compute the hyper-status connectivity indices of some important classes of graphs.Publisher's Versio

    Wiener index of the tensor product of a path and a cycle

    No full text
    The Wiener index, denoted by W(G), of a connected graph G is the sum of all pairwise distances of vertices of the graph, that is, W(G)=½Σu,v∈V(G)d(u,v)W(G) = ½Σ_{u,v ∈ V(G)} d(u,v). In this paper, we obtain the Wiener index of the tensor product of a path and a cycle
    corecore