2021•Akademik Açık Erişim (Işık Üniversitesi)Open access

Bounds on hyper-status connectivity index of graphs

Kannan Pattabiraman, Abishek B. Santhakumar

Abstract

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.

Open-access reader

About this research paper

What this paper is about

Why it matters

OpenAlex reports 1 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

Key concepts: Index (typography), Mathematics, Combinatorics, Computer science, World Wide Web