Total outer connected vertex-edge domination

DOI10.1142/s1793830922500574zbMath1516.05181OpenAlexW4211068830MaRDI QIDQ6174136

No author found.

Publication date: 14 July 2023

Published in: Discrete Mathematics, Algorithms and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s1793830922500574

zbMATH Keywords

treesvertex-edge dominating settotal outer connected vertex-edge dominating set

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Cites Work

• A note on the total outer-connected domination number of a tree
• Total outer-connected domination numbers of trees
• Bounds on the vertex-edge domination number of a tree
• Trees with independent Roman domination number twice the independent domination number
• TOTAL OUTER-CONNECTED DOMINATION SUBDIVISION NUMBERS IN GRAPHS
• Total outer-connected domination in trees
• Total Domination in Graphs
• Total vertex-edge domination
• Edges contained in all or in no minimum edge dominating set of a tree
• Double domination and super domination in trees
• Double vertex-edge domination
• Outer complete fair domination in graphs
• Vertex-edge domination in graphs
• Unnamed Item

This page was built for publication: Total outer connected vertex-edge domination