An upper bound on the total restrained domination number of a tree (Q604747): Difference between revisions
From MaRDI portal
Set profile property. |
Normalize DOI. |
||
(4 intermediate revisions by 3 users not shown) | |||
Property / DOI | |||
Property / DOI: 10.1007/s10878-008-9204-7 / rank | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1007/s10878-008-9204-7 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2000580348 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On total restrained domination in graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3412131 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Total restrained domination in trees / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Nordhaus-Gaddum results for restrained domination and total restrained domination in graphs / rank | |||
Normal rank | |||
Property / DOI | |||
Property / DOI: 10.1007/S10878-008-9204-7 / rank | |||
Normal rank |
Latest revision as of 22:04, 9 December 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | An upper bound on the total restrained domination number of a tree |
scientific article |
Statements
An upper bound on the total restrained domination number of a tree (English)
0 references
12 November 2010
0 references
Let \(V\) be the set of vertices in a given graph. A subset \(S\) of \(V\) is a total restrained domination set if every vertex is adjacent to a vertex in \(S\) and every vertex not in \(S\) is also adjacent to a vertex in \(V - S\). The total restrained domination number of a graph is the minimum cardinality of a total restrained domination set of the graph. A support vertex is a vertex of degree at least two which is adjacent to a leaf. The authors provide an upper bound on the total restrained domination number of a tree in terms of its order, number of leaves and number of support vertices. Finally, trees are constructively characterized attaining the established bound.
0 references
domination number
0 references
total restrained domination tree
0 references