Total domination and vertex-edge domination in tres
From MaRDI portal
Publication:3294995
DOI10.4067/S0716-09172019000200295zbMATH Open1442.05166OpenAlexW2947032853MaRDI QIDQ3294995FDOQ3294995
Authors:
Publication date: 30 June 2020
Published in: Proyecciones (Antofagasta) (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.4067/s0716-09172019000200295
Recommendations
Trees (05C05) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Cites Work
Cited In (11)
- A lower bound on the total vertex-edge domination number of a tree
- Some new degree concepts in graphs
- Total vertex-edge domination in trees
- On a variant of vertex edge domination
- Vertex-edge domination in graphs
- Total outer connected vertex-edge domination
- Vertex-edge domination
- Vertices belonging to all or to no minimum vertex-edge dominating sets in trees
- Total vertex-edge domination
- Graphs with unique minimum vertex-edge dominating sets
- On \(ve\)-degrees and \(ev\)-degrees in graphs
This page was built for publication: Total domination and vertex-edge domination in tres
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3294995)