Results 31 to 40 of about 253,596 (293)

Computing edge version of metric dimension of certain chemical networks [PDF]

Scientific Reports
AbstractIn the modern digital sphere, graph theory is a significant field of research that has a great deal of significance. It finds widespread application in computer science, robotic directions, and chemistry. Additionally, graph theory is used in robot network localization, computer network problems and the formation of various chemical structures ...
Muhammad Umer Farooq, Muhammad Hussain, Ahmed Zubair Jan, Afraz Hussain Mjaeed, Mirwais Sediqma, Ayesha Amjad   +5 more
openalex   +4 more sources

Edge Metric Dimension of Silicate Networks [PDF]

Metric dimension is an essential parameter in graph theory that aids in addressing issues pertaining to information retrieval, localization, network design, and chemistry through the identification of the least possible number of elements necessary to identify the distances between vertices in a graph uniquely. A variant of metric dimension, called the
S. Prabhu, T. Jenifer Janany
openalex   +3 more sources

Edge metric dimension of some classes of circulant graphs [PDF]

Analele Stiintifice ale Universitatii Ovidius Constanta: Seria Matematica, 2020
Let G = (V (G), E(G)) be a connected graph and x, y ∈ V (G), d(x, y) = min{ length of x − y path } and for e ∈ E(G), d(x, e) = min{d(x, a), d(x, b)}, where e = ab. A vertex x distinguishes two edges e1 and e2, if d(e1, x) ≠ d(e2, x). Let WE = {w1, w2, . .
Ahsan Muhammad, Zahid Zohaib, Zafar Sohail   +2 more
doaj   +2 more sources

Extending the metric dimension to graphs with missing edges

Theoretical Computer Science, 2015
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Sabina Zejnilović, Dieter Mitsche, João Gomes, Bruno Sinopoli   +3 more
openalex   +3 more sources

On the edge metric dimension for the random graph [PDF]

, 2016
Let $G(V, E)$ be a connected simple undirected graph. In this paper we prove that the edge metric dimension (introduced by Kelenc, Tratnik and Yero) of the Erd s-R nyi random graph $G(n, p)$ is given by: $$\textrm{edim}(G(n, p)) = (1 + o(1))\frac{4\log(n)}{\log(1/q)},$$ where $q = 1 - 2p(1-p)^2(2-p)$.
Nina Zubrilina
openalex   +3 more sources

Exploring metric dimension of nanosheets, nanotubes, and nanotori of SiO2. [PDF]

PLoS ONE
This work investigates the metric dimension (MD) and edge metric dimension (EMD) of SiO2 nanostructures, specifically nanosheets, nanotubes, and nanotorii.
Umar Farooq, Wasim Abbas, Faryal Chaudhry, Muhammad Azeem, Bandar Almohsen   +4 more
doaj   +2 more sources

On the edge metric dimension of some classes of cacti

AIMS Mathematics
The cactus graph has many practical applications, particularly in radio communication systems. Let $ G = (V, E) $ be a finite, undirected, and simple connected graph, then the edge metric dimension of $ G $ is the minimum cardinality of the edge metric ...
Lyimo Sygbert Mhagama , Muhammad Faisal Nadeem, Mohamad Nazri Husin   +2 more
doaj   +2 more sources

Edge based metric dimension of various coffee compounds.

PLoS ONE
An important dietary source of physiologically active compounds, coffee also contains phenolic acids, diterpenes, and caffeine. According to a certain study, some coffee secondary metabolites may advantageously modify a number of anti-cancer defense ...
Ali Ahmad, Ali N A Koam, Muhammad Azeem, Ibtisam Masmali, Rehab Alharbi   +4 more
doaj   +3 more sources

Computation of mixed resolvability for a circular ladder and its unbounded nature. [PDF]

PLoS ONE
Let Γ = Γ(V ,E) be a simple, planar, connected, and undirected graph. The article primarily concentrates on a category of planar graphs, detailing the explicit identification of each member within this graph family. Within the domain of graph theory, the
Sunny Kumar Sharma, Vijay Kumar Bhat, Muhammad Azeem, Manikonda Gayathri, Bandar Almohsen   +4 more
doaj   +2 more sources

The Metric Dimension of Graph with Pendant Edges [PDF]

, 2008
Summary: For an ordered set \(W = \{w_1,w_2,\dots,w_k\}\) of vertices and a vertex \(v\) in a connected graph \(G\), the representation of \(v\) with respect to \(W\) is the ordered \(k\)-tuple \(r(vlW) = (d(v, w_1),d(v,w_1),\dots,d(v,w_k))\) where \(d(x,y)\) represents the distance between tKe vertices \(x\) and \(y\).
Hazrul Iswadi, Edy Tri Baskoro, Rinovia Simanjuntak, A.N.M. Salman   +3 more
openalex   +2 more sources