Minimal domination via neutrosophic over graphs

Devi, R. Narmada

doi:10.1063/5.0025568

Search citation statements

Order By: Relevance

Paper Sections

Select...

Introduction1

Citation Types

Supporting

Mentioning

Contrasting

Year Published

2022

2023

Publication Types

Select...

Article2

Book1

Other1

Relationship

Self Cite0

Independent4

Authors

Journals

Cited by 4 publications

(1 citation statement)

References 8 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The challenge of identifying the bare minimum of queens required to cover a nxn chessboard gave rise to the mathematical study of dominant sets in graphs in the 1850s.Different writers have explored more than 50 different kinds of domination factors [1]. In 1965 [2], Zadeh developed the concept of a fuzzy set as a framework for mathematically capturing ambiguity and imprecise information. Fuzzy analogs of key graph theoretic notions, including path, cycle, and connectedness, were proposed by Rosenfeld [3].A.…”

Section: Introductionmentioning

confidence: 99%

Co-Neutrosophic Multi-Domination in Co-Neutrosophic Graphs

Majeed¹

2023

Acad. Sci. J.

View full text Add to dashboard Cite

The goal of this article is to examine the ideas of co-neutrosophic multi-dominating (CNMD) set, number 𝛾 𝐶𝑁𝑀𝐷 in a co-neutrosophic graph (𝐺 𝐶𝑁 ) and their inversesrespectively. For specific classes of co-neutrosophic graphs (𝐺 𝐶𝑁 ), the 𝛾 𝐶𝑁𝑀𝐷 and 𝛾 𝐶𝑁𝑀𝐷 −1 calculated and constraints on the corresponding 𝛾 𝐶𝑁𝑀𝐷 drived. Also, some example for evaluation the inverse co-neutrosophic domination provided.

show abstract

Section: Introductionmentioning

confidence: 99%