Results 11 to 20 of about 279,742 (250)
Restrained 2-Resolving Hop Domination in Graphs
European Journal of Pure and Applied Mathematics, 2023 Let G be a connected graph. A set S ⊆ V (G) is a restrained 2-resolving hop dominating set of G if S is a 2-resolving hop dominating set of G and S = V (G) or ⟨V (G)\S⟩ has no isolated vertex. The restrained 2-resolving hop domination number of G,
A. M. Mahistrado, Helen M. Rara
semanticscholar +3 more sources
On the Edge Resolvability of Double Generalized Petersen Graphs
Journal of Mathematics, 2022 For a connected graph G=VG,EG, let v∈VG be a vertex and e=uw ∈EG be an edge. The distance between the vertex v and the edge e is given by dGe,v=mindGu,v,dGw,v. A vertex w∈VG distinguishes two edges e1,e2∈EG if dGw,e1≠dGw,e2.
Tanveer Iqbal +4 more
doaj +2 more sources
Electrical trace analysis of superconducting nanowire photon-number-resolving detectors [PDF]
Physical Review Applied, 2023 We apply principal component analysis (PCA) to a set of electrical output signals from a commercially available superconducting nanowire single-photon detector (SNSPD) to investigate their photon-number-resolving capability.
Timon Schapeler +7 more
semanticscholar +1 more source
Resolving the Steiner Point Removal Problem in Planar Graphs via Shortcut Partitions [PDF]
arXiv.org, 2023 Recently the authors [CCLMST23] introduced the notion of shortcut partition of planar graphs and obtained several results from the partition, including a tree cover with $O(1)$ trees for planar metrics and an additive embedding into small treewidth ...
Hsien-Chih Chang +5 more
semanticscholar +1 more source
Computation of Resolvability Parameters for Benzenoid Hammer Graph
Journal of Mathematics, 2022 A representation of each vertex of a network into distance-based arbitrary tuple form, adding the condition of uniqueness of each vertex with reference to some settled vertices. Such settled vertices form a set known as resolving set.
Ali Ahmad, Al-Nashri Al-Hossain Ahmad
doaj +1 more source
On vertex resolvability of a circular ladder of nonagons [PDF]
Notes on Number Theory and Discrete Mathematics, 2023 Let H=H(V,E) be a non-trivial simple connected graph with edge and vertex set E(H) and V(H), respectively. A subset D⊂V(H) with distinct vertices is said to be a vertex resolving set in H if for each pair of distinct vertices p and q in H we have d(p,u ...
Sunny Kumar Sharma, Vijay Kumar Bhat
doaj +1 more source
Edge Metric and Fault-Tolerant Edge Metric Dimension of Hollow Coronoid
Mathematics, 2021 Geometric arrangements of hexagons into six sides of benzenoids are known as coronoid systems. They are organic chemical structures by definition. Hollow coronoids are divided into two types: primitive and catacondensed coronoids.
Ali N. A. Koam +3 more
doaj +1 more source
On Minimal Edge Version of Doubly Resolving Sets of a Graph [PDF]
Journal of Combinatorial Mathematics and Combinatorial Computing, 2018 In this paper, we introduce the edge version of doubly resolving set of a graph which is based on the edge distances of the graph. As a main result, we computed the minimum cardinality \(\psi_E\) of edge version of doubly resolving sets of family of \(n\)
Muhammad Saeed Ahmad +2 more
semanticscholar +1 more source
Resolving ECRH deposition broadening due to edge turbulence in DIII-D [PDF]
Physics of Plasmas, 2017 Interaction between microwave power, used for local heating and mode control, and density fluctuations can produce a broadening of the injected beam, as confirmed in experiment and simulation.
M. Brookman +10 more
semanticscholar +1 more source
The Vertex-Edge Resolvability of Some Wheel-Related Graphs
Journal of Mathematics, 2021 A vertex w∈VH distinguishes (or resolves) two elements (edges or vertices) a,z∈VH∪EH if dw,a≠dw,z. A set Wm of vertices in a nontrivial connected graph H is said to be a mixed resolving set for H if every two different elements (edges and vertices) of H ...
Bao-Hua Xing +4 more
doaj +1 more source