1 citations · 1 across the 6 of their papers we have counts for
6 papers
Solution to an open problem on the closeness of graphs
Fazal Hayat, Shou-Jun Xu
A network can be analyzed by means of many graph theoretical parameters. In the context of networks analysis, closeness is a structural metric that evaluates a node's significance…
Maximum values of the edge Mostar index in tricyclic graphs
Fazal Hayat, Shou-Jun Xu, Bo Zhou
For a graph , the edge Mostar index of is the sum of over all edges of , where denotes the number of edges of that have a smal…
Extremal results on the Mostar index of trees with fixed parameters
Fazal Hayat, Shou-Jun Xu
For a graph , the Mostar index of is the sum of - over all edges of , where denotes the number of vertices of that have a smaller…
Disproof of a conjecture on the edge Mostar index
Fazal Hayat, Shou-Jun Xu, Bo Zhou
For a given connected graph , the edge Mostar index is defined as , where and are respectively…
On the maximum CEI of graphs with paprameters
Fazal Hayat
The connective eccentricity index (CEI) of a graph is defined as , where is the degree of and $\varepsi…
On extremal results of multiplicative Zagreb indices of trees with given distance -domination number
Fazal Hayat
The first multiplicative Zagreb index of a graph is the product of the square of every vertex degree, while the second multiplicative Zagreb index is the product of…