Results 191 to 200 of about 133,073 (208)
Some of the next articles are maybe not open access.
Strong resolving graph of a zero-divisor graph
Revista de la Real Academia de Ciencias Exactas, Físicas y Naturales. Serie A. Matemáticas, 2022In this paper, the authors determine the structure of the strong resolving graph of the zero divisor graph \(\Gamma(R)\) of a commutative ring \(R\). The zero-divisor graph \(\Gamma(R)\) of a commutative unital ring \(R\) is the (simple undirected) graph whose vertex set is all nonzero zero divisors of \(R\) and two distinct vertices are joined by an ...
Nikandish, R. +2 more
openaire +4 more sources
On resolving strong domination number of several graph classes
AIP Conference Proceedings, 2023Dafik Dafik +5 more
openaire +3 more sources
Strong resolving graph and strong metric dimension of a compressed zero divisor graph
Journal of Algebra and Its ApplicationsLet [Formula: see text] be a commutative ring with [Formula: see text] and [Formula: see text] be the set of zero-divisors of [Formula: see text]. The relation on [Formula: see text] given by [Formula: see text] if and only if [Formula: see text] is an equivalence relation, where [Formula: see text].
M. Khazaee, M. Maghasedi, F. Heydari
openaire +1 more source
DETERMINING FUZZY LABELING OF A WHEEL GRAPH AND ITS STRONG FUZZY RESOLVING SET
Far East Journal of Mathematical Sciences (FJMS)Given a fuzzy set on , a graph is called a fuzzy labeling graph if and are bijective membership functions such that every vertex and edge receive a unique membership degree and satisfies for . A graph formed from a single vertex connected to the vertices of a cycle of length is called a wheel graph.
Isnaini Rosyida +4 more
openaire +1 more source
On Strong Fuzzy Resolving Set of Fuzzy Wheel Graphs
Advances in Nonlinear Variational InequalitiesLet Image be a fuzzy set on Image. A fuzzy labeling graph Image is a graph with bijective membership functions Image and Image so that each vertex’s membership degree and every edge’s membership value are different. Further, it satisfies Image for Image. “A graph formed from a single vertex connected to the vertices of a cycle of length Image is called
openaire +1 more source
Graph pangenome captures missing heritability and empowers tomato breeding
Nature, 2022Yao Zhou, Zhiyang Zhang, Zhigui Bao
exaly
Strong metric dimension in annihilating-ideal graph of commutative rings
Applicable Algebra in Engineering, Communications and Computing, 2022Reza Nikandish
exaly
Optimal Multi-Level Fault-Tolerant Resolving Sets of Circulant Graph C(n : 1, 2)
Mathematics, 2023Laxman Saha +2 more
exaly
Edge Version of Metric Dimension and Doubly Resolving Sets of the Necklace Graph
Mathematics, 2018Jia-Bao Liu, Zohaib Zahid, Waqas Nazeer
exaly