Results 11 to 20 of about 1,561,879 (232)

Computing Bounds of Fractional Metric Dimension of Metal Organic Graphs [PDF]

open access: yesJournal of Chemistry, 2021
Metal organic graphs are hollow structures of metal atoms that are connected by ligands, where metal atoms are represented by the vertices and ligands are referred as edges. A vertex x resolves the vertices u and v of a graph G if du,x≠dv,x. For a pair u,
Mohsin Raza   +3 more
doaj   +3 more sources

Characterization of (Molecular) Graphs with Fractional Metric Dimension as Unity [PDF]

open access: yesJournal of Chemistry, 2021
Distance-based dimensions provide the foreground for the identification of chemical compounds that are chemically and structurally different but show similarity in different reactions.
Muhammad Javaid   +3 more
doaj   +3 more sources

Studies of Connected Networks via Fractional Metric Dimension

open access: yesJournal of Mathematics, 2022
Metric dimension is an effective tool to study different distance-based problems in the field of telecommunication, robotics, computer networking, integer programming, chemistry, and electrical networking.
Hassan Zafar   +2 more
doaj   +3 more sources

Metric-Based Fractional Dimension of Rotationally-Symmetric Line Networks

open access: yesSymmetry, 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.
Muhammad Javaid, Rashad Ismail
exaly   +3 more sources

The fractional strong metric dimension in three graph products [PDF]

open access: yesDiscrete 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
Ismael G Yero, Eunjeong Yi, Cong X Kang
exaly   +5 more sources

On Rotationally Symmetrical Planar Networks and Their Local Fractional Metric Dimension

open access: yesSymmetry, 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 ...
Hanen Karamti   +2 more
exaly   +4 more sources

The fractional metric dimension of graphs [PDF]

open access: yesDiscrete Mathematics, 2012
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Subramanian Arumugam, Varughese Mathew
exaly   +5 more sources

Classification of Upper Bound Sequences of Local Fractional Metric Dimension of Rotationally Symmetric Hexagonal Planar Networks [PDF]

open access: yesJournal of Mathematics, 2021
The term metric or distance of a graph plays a vital role in the study to check the structural properties of the networks such as complexity, modularity, centrality, accessibility, connectivity, robustness, clustering, and vulnerability.
Shahbaz Ali   +3 more
doaj   +3 more sources

Metric Dimension of Nonplanar Networks by Fractional Technique With Application

open access: yesIEEE Access
The fractional versions of graph-theoretic invariants expand the range of applications like connectivity, scheduling, assignment, and operational research.
Arooba Fatima   +2 more
doaj   +4 more sources

Fractional Metric Dimension of Tree and Unicyclic Graph [PDF]

open access: yesProcedia Computer Science, 2015
AbstractA vertex v in a simple connected graph G resolves two vertices x and y in G if the distance from x to v is not equal to distance from y to v. The vertex set R{x, y} is defined as the set of vertices in G which resolve x and y. A function f : V(G) → [0,1] is called a resolving function of G if f (R{x, y}) ≥ 1 for any two distinct vertices x and ...
Suhadi Wido Saputro
exaly   +3 more sources

Home - About - Disclaimer - Privacy