Graph In Graph Theory

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 …
Cite DOI
Hamilton Connectivity of Convex Polytopes with Applications to Their Detour Index
A connected graph is called Hamilton-connected if there exists a Hamiltonian path between any pair of its vertices. Determining whether …
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 …
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 …
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. …
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 …
Cite DOI
Fault-tolerant resolvability and extremal structures of graphs
In this paper, we consider fault-tolerant resolving sets in graphs. We characterize n-vertex graphs with fault-tolerant metric …
Cite DOI
Binary locating-dominating sets in rotationally-symmetric convex polytopes
A convex polytope or simply polytope is the convex hull of a finite set of points in Euclidean space ℝd. Graphs of convex polytopes …
Cite DOI
On the fault-tolerant metric dimension of convex polytopes
A convex polytopes is a polytope that is also a convex set of points in the n-dimensional Euclidean space Rn. By preserving the same …
Cite DOI