Domination Numbers of Amalgamations of Cycles at Connected Subgraphs
A set S of vertices of a graph G is a dominating set of G if every vertex in VG is adjacent to some vertex in S. A minimum dominating set in a graph G is a dominating set of minimum cardinality. The cardinality of a minimum dominating set is called the domination number of G and is denoted by γG. Le...
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Wiley
2022-01-01
|
| Series: | Journal of Mathematics |
| Online Access: | http://dx.doi.org/10.1155/2022/7336728 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|