Results 201 to 210 of about 269,190 (213)
Some of the next articles are maybe not open access.
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
semanticscholar +2 more sources
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.
I. Rosyida +3 more
semanticscholar +2 more sources
On resolving strong domination number of several graph classes
AIP Conference Proceedings, 2023D. Dafik +5 more
semanticscholar +2 more sources
Strong Resolving Graphs of U ‐Clean Graphs of Finite Commutative Rings
Journal of mathematicsLet R be a finite commutative ring with identity 1. The U ‐clean graph U ‐ C
Ziyi Wu, Xiaobin Yin
semanticscholar +1 more source
The Forcing Strong Metric Dimension of a Graph
Contributions Discret. Math., 2017For any two vertices u, v in a connected graph G, the interval I(u, v) consists of all vertices which are lying in some u − v shortest path in G. A vertex x in a graph G strongly resolves a pair of vertices u, v if either u ∈ I(x, v) or v ∈ I(x, u).
R. Lenin, K. Kathiresan, M. Bača
semanticscholar +1 more source
ACM Multimedia
Large language models (LLMs) have demonstrated strong performance in natural language generation but remain limited in knowle- dge-intensive tasks due to outdated or incomplete internal knowledge.
Dong Li +5 more
semanticscholar +1 more source
Large language models (LLMs) have demonstrated strong performance in natural language generation but remain limited in knowle- dge-intensive tasks due to outdated or incomplete internal knowledge.
Dong Li +5 more
semanticscholar +1 more source
International journal of neutrosophic science
A neutrosophic set (NS) contains 3 modules such as the degree of truth (T), degree of falsity (F), and degree of indeterminacy (I). While fuzzy graphs (FG) occasionally fall short of providing optimum outcomes, the NS and neutrosophic graphs (NG) provide
Elvir Elvir +4 more
semanticscholar +1 more source
A neutrosophic set (NS) contains 3 modules such as the degree of truth (T), degree of falsity (F), and degree of indeterminacy (I). While fuzzy graphs (FG) occasionally fall short of providing optimum outcomes, the NS and neutrosophic graphs (NG) provide
Elvir Elvir +4 more
semanticscholar +1 more source
Training-Free Multimodal Deepfake Detection via Graph Reasoning
arXiv.orgMultimodal deepfake detection (MDD) aims to uncover manipulations across visual, textual, and auditory modalities, thereby reinforcing the reliability of modern information systems.
Yuxin Liu +7 more
semanticscholar +1 more source
Fault-Tolerant Strong Metric Dimension of Rooted Product Graphs
Communications on Applied Nonlinear AnalysisThe concept of fault tolerance in graph theory is critical in designing robust networks, ensuring that essential graph properties are preserved despite failures of vertices or edges.
H. Prathab +2 more
semanticscholar +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

