Results 21 to 30 of about 279,742 (250)
Fault-tolerant metric dimension of zero-divisor graphs of commutative rings
AKCE International Journal of Graphs and Combinatorics, 2021 Let R be a commutative ring with identity. The zero-divisor graph of R denoted by is an undirected graph where is the set of non-zero zero-divisors of R and there is an edge between the vertices z1 and z2 in if A set of vertices S resolves a graph G if ...
Sahil Sharma, Vijay Kumar Bhat
doaj +1 more source
Edge Metric Dimension and Edge Basis of One-Heptagonal Carbon Nanocone Networks
IEEE Access, 2022 A molecular (chemical) graph is a simple connected graph, where the vertices represent the compound’s atoms and the edges represent bonds between the atoms, and the degree (valence) of every vertex (atom) is not more than four.
Karnika Sharma +2 more
doaj +1 more source
The dominant metric dimension of graphs
Heliyon, 2020 The G be a connected graph with vertex set V(G) and edge set E(G). A subset S⊆V(G) is called a dominating set of G if for every vertex x in V(G)∖S, there exists at least one vertex u in S such that x is adjacent to u.
Liliek Susilowati +4 more
doaj +1 more source
Fractional Metric Dimension of Generalized Sunlet Networks
Journal of Mathematics, 2021 Let N=VN,EN be a connected network with vertex VN and edge set EN⊆VN,EN. For any two vertices a and b, the distance da,b is the length of the shortest path between them.
Muhammad Javaid +2 more
doaj +1 more source
Edge-disjoint cycles with the same vertex set [PDF]
Advances in MathematicsIn 1975, Erd\H{o}s asked for the maximum number of edges that an $n$-vertex graph can have if it does not contain two edge-disjoint cycles on the same vertex set. It is known that Tur\'an-type results can be used to prove an upper bound of $n^{3/2+o(1)}$.
Debsoumya Chakraborti +3 more
semanticscholar +1 more source
Computing the partition dimension of certain families of Toeplitz graph
Frontiers in Computational Neuroscience, 2022 Let G = (V(G), E(G)) be a graph with no loops, numerous edges, and only one component, which is made up of the vertex set V(G) and the edge set E(G). The distance d(u, v) between two vertices u, v that belong to the vertex set of H is the shortest path ...
Ricai Luo +5 more
doaj +1 more source
A Reconfigurable energy-resolving method for a layered edge-on detector
Physics in Medicine and Biology, 2019 Currently, most of the x-ray spectral detectors can extract signals in a set number of energy bins, that inevitably reduces the dynamic range and energy resolution of the imaging system.
Zai-Feng Shi +5 more
semanticscholar +1 more source
Resolving sets of vertices with the minimum size in graphs [PDF]
ریاضی و جامعه, 2023 Suppose that $G$ is a simple connected graph with vertex set $V(G)$ and edge set $E(G)$. A subset $S=\{s_1, s_2,\ldots , s_l \}$ of vertices of graph $G$ is called a doubly resolving set of $G$, if for any distinct vertices $u$ and $v$ in $G$ there are ...
Ali Zafari, Nader Habibi, Saeid Alikhani
doaj +1 more source
On resolving efficient domination number of path and comb product of special graph
Journal of Physics, Conference Series, 2022 We use finite, connected, and undirected graph denoted by G. Let V (G) and E(G) be a vertex set and edge set respectively. A subset D of V (G) is an efficient dominating set of graph G if each vertex in G is either in D or adjoining to a vertex in D.
I. Kusumawardani +4 more
semanticscholar +1 more source
PLoS ONE, 2022 Freshwaters are a very valuable resource in arid areas, such as Mediterranean countries. Freshwater systems are vulnerable ecological habitats, significantly disturbed globally and especially in arid areas.
R. Tadmor-Levi +6 more
semanticscholar +1 more source