No label defined (Q3976627)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 19197
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | No label defined |
scientific article; zbMATH DE number 19197 |
Statements
26 June 1992
0 references
domination number
0 references
degree
0 references
0.853323221206665
0 references
[For the entire collection see Zbl 0734.00014.] Let \(G\) be a graph. Lower bounds of the \(n\)-total domination number \(\gamma_{tn}(G)\) and its relations with the total domination number \(\gamma_ t(G)\) are studied in this paper. Let \(\Delta\) and \(\delta\) be the maximum degree and the minimum degree of \(G\) and \(p\) be the order of \(G\). The main theorem in this paper is: if \(G\) is connected, then \(\gamma_{tn}(G)\geq\gamma_ t(G)+\delta-1\).
0 references