Fazal Hayat

According to our database, Fazal Hayat authored at least 6 papers between 2020 and 2025.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of three.

2025

Extremal results on the Mostar index of trees with fixed parameters.

Fazal Hayat, Shou-Jun Xu

Discret. Math. Algorithms Appl., February, 2025

2024

Minimizing the second Zagreb eccentricity index in bipartite graphs with a fixed size and diameter.

Fazal Hayat, Shou-Jun Xu, Xuli Qi

J. Appl. Math. Comput., October, 2024

Extremal k-Connected Graphs with Maximum Closeness.

Fazal Hayat, Daniele Ettore Otera

Axioms, 2024

2023

Solution to an open problem on the closeness of graphs.

Fazal Hayat, Shou-Jun Xu

CoRR, 2023

2021

On the maximum connective eccentricity index among k-connected graphs.

Fazal Hayat

Discret. Math. Algorithms Appl., 2021

2020

The minimum second Zagreb eccentricity index of graphs with parameters.

Fazal Hayat

Discret. Appl. Math., 2020