Existence of graphs with a given domination parameter (Q2888269)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Existence of graphs with a given domination parameter |
scientific article; zbMATH DE number 6039779
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Existence of graphs with a given domination parameter |
scientific article; zbMATH DE number 6039779 |
Statements
30 May 2012
0 references
domination number
0 references
total domination number
0 references
edge domination number
0 references
total edge domination number
0 references
arithmetic graph
0 references
0.9117653
0 references
0.90819776
0 references
0.9052981
0 references
Existence of graphs with a given domination parameter (English)
0 references
The authors introduce arithmetic graphs. The sets of vertices are integers and adjacency is based on divisibility. It is shown that for given value \(r\) there exist arithmetic graphs \(G\) with dominating number \(\gamma(G)=r\). Similarly it is shown that there exist arithmetic graphs with given total dominating number, edge domination number, and total edge domination number with given value.
0 references
