Total outer-connected domination in trees
From MaRDI portal
Publication:2997598
DOI10.7151/DMGT.1500zbMATH Open1217.05059OpenAlexW1972605311MaRDI QIDQ2997598FDOQ2997598
Authors: Joanna Cyman 
Publication date: 9 May 2011
Published in: Discussiones Mathematicae Graph Theory (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/87b30c4e75511dd7d2dd907b1e4c7b556a7c71cb
Recommendations
- Total domination versus total outer connected domination in trees
- Total outer-connected domination numbers of trees
- A note on the total outer-connected domination number of a tree
- On the total outer-connected domination in graphs
- The outer-connected vertex edge domination number of a tree
- Total vertex-edge domination in trees
- Generalization of the total outer-connected domination in graphs
- scientific article; zbMATH DE number 5823716
- On the outer-connected domination in graphs
- On trees with equal domination and total outer-independent domination numbers
Trees (05C05) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Cited In (20)
- Certified domination
- Total domination on tree operators
- A note on the total outer-connected domination number of a tree
- A lower bound on the total outer-independent domination number of a tree
- Total outer-connected domination numbers of trees
- Bounds on the signed Roman \(k\)-domination number of a digraph
- Outer-connected domination upon edge removal in graphs
- Total outer connected vertex-edge domination
- Domination related parameters in the generalized lexicographic product of graphs
- On the total outer-connected domination in graphs
- Total domination versus total outer connected domination in trees
- Generalization of the total outer-connected domination in graphs
- Total outer-connected domination subdivision numbers in graphs
- Total domination and least domination in a tree
- An upper bound on the total outer-independent domination number of a tree
- Domination and its variants in split graphs \(-\text{P}\) versus NPC dichotomy
- Complexity of total outer-connected domination problem in graphs
- On the complexity of the minimum outer-connected dominating set problem in graphs
- Inequality of Nordhaus-Gaddum type for total outer-connected domination in graphs
- Trees with large neighborhood total domination number
This page was built for publication: Total outer-connected domination in trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2997598)
