Results 21 to 30 of about 4,153 (238)
On the Fractional Metric Dimension of Convex Polytopes [PDF]
Mathematical Problems in Engineering, 2021 In order to identify the basic structural properties of a network such as connectedness, centrality, modularity, accessibility, clustering, vulnerability, and robustness, we need distance-based parameters. A number of tools like these help computer and chemical scientists to resolve the issues of informational and chemical structures.
Muhammad Kamran Aslam +3 more
+4 more sources
On Sharp Bounds of Local Fractional Metric Dimension for Certain Symmetrical Algebraic Structure Graphs [PDF]
Symmetry, 2023 The smallest set of vertices needed to differentiate or categorize every other vertex in a graph is referred to as the graph’s metric dimension. Finding the class of graphs for a particular given metric dimension is an NP-hard problem. This concept has applications in many different domains, including graph theory, network architecture, and facility ...
Amal S. Alali +3 more
openalex +4 more sources
Local fractional metric dimension of rotationally symmetric planar graphs arisen from planar chorded cycles [PDF]
Rendiconti di Matematica e delle Sue Applicazioni, 2021 20 pages, 8 figures and 8 ...
Shahbaz Ali +2 more
openalex +7 more sources
On Rotationally Symmetrical Planar Networks and Their Local Fractional Metric Dimension [PDF]
Symmetry, 2023 The metric dimension has various applications in several fields, such as computer science, image processing, pattern recognition, integer programming problems, drug discovery, and the production of various chemical compounds. The lowest number of vertices in a set with the condition that any vertex can be uniquely identified by the list of distances ...
Shahbaz Ali +4 more
openalex +2 more sources
Fractional metric dimension of generalized prism graph
Proyecciones (Antofagasta), 2022 Fractional metric dimension of connected graph $G$ was introduced by Arumugam et al. in [Discrete Math. 312, (2012), 1584-1590] as a natural extension of metric dimension which have many applications in different areas of computer sciences for example optimization, intelligent systems, networking and robot navigation.
Nosheen Goshi +2 more
openalex +4 more sources
Fractional Local Metric Dimension of Comb Product Graphs
مجلة بغداد للعلوم, 2020 The local resolving neighborhood of a pair of vertices for and is if there is a vertex in a connected graph where the distance from to is not equal to the distance from to , or defined by .
Siti Aisyah +2 more
doaj +2 more sources
Local Fractional Metric Dimensions of Rotationally Symmetric and Planar Networks [PDF]
IEEE Access, 2020 Mathematical modeling, coding or labeling with the help of numeric numbers based on the parameter of distance plays a vital role in the studies of the structural properties of the networks such as accessibility, centrality, clustering, complexity ...
Jia-Bao Liu +2 more
doaj +2 more sources
Metric-Based Fractional Dimension of Rotationally-Symmetric Line Networks [PDF]
Symmetry, 2023 The parameter of distance plays an important role in studying the properties symmetric networks such as connectedness, diameter, vertex centrality and complexity. Particularly different metric-based fractional models are used in diverse fields of computer science such as integer programming, pattern recognition, and in robot navigation.
Rashad Ismail +2 more
openalex +2 more sources
The fractional strong metric dimension in three graph products [PDF]
Discrete Applied Mathematics, 2018 For any two distinct vertices $x$ and $y$ of a graph $G$, let $S\{x, y\}$ denote the set of vertices $z$ such that either $x$ lies on a $y-z$ geodesic or $y$ lies on an $x-z$ geodesic. Let $g: V(G) \rightarrow [0,1]$ be a real valued function and, for any $U \subseteq V(G)$, let $g(U)=\sum_{v \in U}g(v)$. The function $g$ is a strong resolving function
Cong X. Kang +2 more
openalex +4 more sources
On fractional metric dimension of comb product graphs
Statistics, Optimization & Information Computing, 2018 A vertex $z$ in a connected graph $G$ \textit{resolves} two vertices $u$ and $v$ in $G$ if $d_G(u,z)\neq d_G(v,z)$. \ A set of vertices $R_G\{u,v\}$ is a set of all resolving vertices of $u$ and $v$ in $G$. \ For every two distinct vertices $u$ and $v$ in $G$, a \textit{resolving function} $f$ of $G$ is a real function $f:V(G)\rightarrow[0,1]$ such ...
Suhadi Wido Saputro +3 more
openalex +3 more sources