Mathematics at UBD
Mathematics at UBD
People
News
Publications
Programmes
Discovery Year
Light
Dark
Automatic
Connected Graph
On Resolvability-and Domination-Related Parameters of Complete Multipartite Graphs
Graphs of order n with fault-tolerant metric dimension n have recently been character-ized.This paper points out an error in the proof …
S. Hayat
,
A. Khan
,
Y. Zhong
Cite
DOI
On the Laplacians and Normalized Laplacians for Graph Transformation with Respect to the Dicyclobutadieno Derivative of [n]Phenylenes
As a crucial tool for exploring and characterizing the structure properties of the molecular graphs, spectrum analysis and computation …
J.-B. Liu
,
Q. Zheng
,
Z.-Q. Cai
,
S. Hayat
Cite
DOI
Topological index analysis of a class of networks analogous to alicyclic hydrocarbons and their derivatives
Alicyclic hydrocarbons and their derivatives have been studied extensively by researchers in recent years. Actually, they are a …
J.-B. Liu
,
X.-B. Peng
,
S. Hayat
Cite
DOI
On Hamilton-Connectivity and Detour Index of Certain Families of Convex Polytopes
A convex polytope is the convex hull of a finite set of points in the Euclidean space ℝn. By preserving the adjacency-incidence …
S. Hayat
,
M.Y.H. Malik
,
A. Ahmad
,
S. Khan
,
F. Yousafzai
,
R. Hasni
Cite
DOI
On the Laplacians for Strong Product Graphs Based on Polyacene Graphs
Let Hn be the molecular graph of a linear polyacene chain. In this paper, we introduce a kind of linear polyacene cylinder graph …
J.-B. Liu
,
J.-J. Gu
,
S. Hayat
Cite
DOI
The Normalized Laplacians, Degree-Kirchhoff Index, and the Complexity of Möbius Graph of Linear Octagonal-Quadrilateral Networks
The normalized Laplacian plays an indispensable role in exploring the structural properties of irregular graphs. Let Ln8,4 represent a …
J.-B. Liu
,
Q. Zheng
,
S. Hayat
Cite
DOI
Resistance distance-based graph invariants and the number of spanning trees of linear crossed octagonal graphs
Resistance distance is a novel distance function, also a new intrinsic graph metric, which makes some extensions of ordinary distance. …
J. Zhao
,
J.-B. Liu
,
S. Hayat
Cite
DOI
Fault-Tolerant Metric Dimension of Interconnection Networks
A fixed interconnection parallel architecture is characterized by a graph, with vertices corresponding to processing nodes and edges …
S. Hayat
,
A. Khan
,
M.Y.H. Malik
,
M. Imran
,
M.K. Siddiqui
Cite
DOI
Resolvability and fault-tolerant resolvability structures of convex polytopes
In this paper, we study resolvability and fault-tolerant resolvability of convex polytopes and related geometric graphs. Imran et al. …
H.M.A. Siddiqui
,
S. Hayat
,
A. Khan
,
M. Imran
,
A. Razzaq
,
J.-B. Liu
Cite
DOI
On the fault-tolerant metric dimension of certain interconnection networks
Metric dimension and fault-tolerant metric dimension have potential applications in telecommunication, robot navigation and …
H. Raza
,
S. Hayat
,
X.-F. Pan
Cite
DOI
»
Cite
×