2022
DOI: 10.1063/5.0067066
|View full text |Cite
|
Sign up to set email alerts
|

Total co-even domination in graphs in some of engineering project theoretically

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2023
2023
2024
2024

Publication Types

Select...
2

Relationship

0
2

Authors

Journals

citations
Cited by 2 publications
(1 citation statement)
references
References 23 publications
0
1
0
Order By: Relevance
“…The domination number ๐›พ(๐บ) is the minimum cardinality of a dominating set D of G. If V-D contains a dominating set, then this set is called an inverse set of D in G. The symbol ๐›พ โˆ’1 (๐บ) represents the minimum cardinality over all inverse dominating set of G [2]. The concept of domination is used to solve many problems in various fields of mathematics subjects such as topological graphs [2,3], fuzzy graphs [4,5], and [6,7], number theory graph [8], general graphs [9][10][11][12][13][14][15][16][17][18], and others. The reader can be found all notions not mentioned [19][20][21][22].…”
Section: Introductionmentioning
confidence: 99%
“…The domination number ๐›พ(๐บ) is the minimum cardinality of a dominating set D of G. If V-D contains a dominating set, then this set is called an inverse set of D in G. The symbol ๐›พ โˆ’1 (๐บ) represents the minimum cardinality over all inverse dominating set of G [2]. The concept of domination is used to solve many problems in various fields of mathematics subjects such as topological graphs [2,3], fuzzy graphs [4,5], and [6,7], number theory graph [8], general graphs [9][10][11][12][13][14][15][16][17][18], and others. The reader can be found all notions not mentioned [19][20][21][22].…”
Section: Introductionmentioning
confidence: 99%