Total outer connected vertex-edge domination

DOI10.1142/S1793830922500574zbMATH Open1516.05181OpenAlexW4211068830MaRDI QIDQ6174136FDOQ6174136

Author name not available (Why is that?)

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

Recommendations

• The outer-connected vertex edge domination number of a tree
• Total vertex-edge domination
• Total vertex-edge domination in trees
• A lower bound on the total vertex-edge domination number of a tree
• Total domination and vertex-edge domination in tres

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

• Total outer-connected domination subdivision numbers in graphs
• Total Domination in Graphs
• Bounds on the vertex-edge domination number of a tree
• Title not available (Why is that?)
• Total outer-connected domination in trees
• A note on the total outer-connected domination number of a tree
• Total outer-connected domination numbers of trees
• Double vertex-edge domination
• Vertex-edge domination in graphs
• Double domination and super domination in trees
• Total vertex-edge domination
• Trees with independent Roman domination number twice the independent domination number
• Edges contained in all or in no minimum edge dominating set of a tree
• Outer complete fair domination in graphs

Cited In (1)

• Total vertex-edge domination in graphs: Complexity and algorithms

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6174136)