2 citations · 3 across the 4 of their papers we have counts for
7 papers
Unique identification and domination of edges in a graph: The vertex-edge dominant edge metric dimension
H. M. Ikhlaq, S. Hayat, H. M. A. Siddiqui
Dominating sets and resolving sets have important applications in control theory and computer science. In this paper, we introduce an edge-analog of the classical dominant metric d…
The Laplacian and normalized Laplacian spectra of Mobius polyomino networks and their applications
Zhi-Yu Shi, Jia-Bao Liu, Sakander Hayat
Spectral theory has widely used in complex networks and solved some practical problems. In this paper, we investigated the Laplacian and normalized Laplacian spectra of Mobius poly…
The normalized Laplacians and random walks of the parallel subdivision graphs
Jing Zhao, Jia-Bao Liu, Ying-Ying Tan +1
The -parallel subdivision graph is generated from which each edge of is replaced by parallel paths of length 2. The -parallel subdivision graph $S_{2k}(…
Resistance distance-based graph invariants and the number of spanning trees of linear crossed octagonal graphs
Jing Zhao, Jia-Bao Liu, Sakander Hayat
Resistance distance is a novel distance function, also a new intrinsic graph metric, which makes some extensions of ordinary distance. Let On be a linear crossed octagonal graph. R…
A spectral characterization of the s-clique extension of the square grid graphs
Sakander Hayat, Jack H. Koolen, Muhammad Riaz
In this paper we show that for integers , , any co-edge-regular graph which is cospectral with the -clique extension of the -grid is the -clique ex…
Bicyclic graphs with extremal degree resistance distance
Jia-Bao Liu, Si-Qi Zhangb, Xiang-Feng Pan +2
Let be the resistance distance between two vertices of a simple graph , which is the effective resistance between the vertices in the corresponding electrical ne…