The concept of hop hub-integrity is introduced as a new measure of the stability of a graph G
and it is defined as HhI (G)= min {| S|+ m (G− S)}, where S is hop hub set and m (G− S) is the …

HUB-INTEGRITY OF LINE GRAPHS 1. Introduction By a graph G = (V,E), we mean a finite,
undirected graph without loops or multiple Page 1 Electronic Journal of Mathematical …

With the growing demand for information transport, networks and network architecture have
grown increasingly vital. Nodes and the connections that connect them make up a …

Graph polynomials are polynomials assigned to graphs. Interestingly, they also arise in
many areas outside graph theory as well. Many properties of graph polynomials have been …

The ABC index is one of the most applicable topological graph indices and several
properties of it has been studied already due to its extensive chemical applications. Several …

The field of graph theory is one of the ever growing branch of mathematics. Graph theory, in
its essence can be described as the study of relations on finite sets, which are visualized …

The hub-integrity of a graph is given by the minimum of| S|+ m (G− S), where S is a hub set
and m (G− S) is the maximum order of the components of G− S. In this paper, the concept of …