Results 81 to 90 of about 8,068,470 (244)
The uncrossing partial order on matchings is Eulerian [PDF]
, 2014 We prove that the partial order on the set of matchings of 2n points on a circle, given by resolving crossings, is an Eulerian poset.Comment: 6 ...
Lam, Thomas
core
On resolving efficient domination number of comb product of special graphs
, 2021 Let G be a connected, finite, and undirected graph. A vertex set D in G is an efficient dominating set of G if D is an independent set and for each point υ ∈ V(G)-D is adjacent to precisely one vertex d ∈ D.
R. A. Hakim +4 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
The distance 2-resolving domination number of graphs
, 2021 The distance 2-resolving dominating set is the combination of two concepts, the resolving set and the distance 2-dominating set. The distance 2-resolving dominating set is a set that is both a distance 2-dominating set and a resolving set. The distance 2-
D. Wardani +3 more
semanticscholar +1 more source
Computation of Edge Resolvability of Benzenoid Tripod Structure
Journal of Mathematics, 2021 In chemistry, graphs are commonly used to show the structure of chemical compounds, with nodes and edges representing the atom and bond types, respectively.
Ali Ahmad +4 more
doaj +1 more source
Computing vertex resolvability of benzenoid tripod structure
AIMS Mathematics, 2022 In this paper, we determine the exact metric and fault-tolerant metric dimension of the benzenoid tripod structure. We also computed the generalized version of this parameter and proved that all the parameters are constant.
Maryam Salem Alatawi +4 more
doaj +1 more source
The Metric Dimension of Amalgamation of Cycles [PDF]
, 2010 For an ordered set W = {w_1, w_2 , ..., 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(v|W) = (d(v,w_1), d(v,w_2 ), ..., d (v,w_k )), where d(x,y) represents the distance ...
Baskoro, Edy Tri +3 more
core
Conditional resolvability in graphs: a survey
International Journal of Mathematics and Mathematical Sciences, 2004 For an ordered set W={w1,w2,…,wk} of vertices and a vertex v in a connected graph G, the code of v with respect to W is the k-vector cW(v)=(d(v,w1),d(v,w2),…,d(v,wk)), where d(x,y) represents the distance between the vertices x and y.
Varaporn Saenpholphat, Ping Zhang
doaj +1 more source
A first global height-resolved cloud condensation nuclei data set derived from spaceborne lidar measurements [PDF]
, 2023 Goutam Choudhury, Matthias Tesche
openalex +1 more source
On regular fuzzy resolving set
, 2022 In a fuzzy graph G, if the degree of each vertex is the same, then it is called a regular fuzzy graph. The representation of ? ? H with respect to the subset H of ? are all distinct then H is called the resolving set of the fuzzy graph G(V, ?, µ).
Shanmugapriya, R., Jiny D., Mary
openaire +1 more source