Well \textit{ve}-covered graphs

DOI10.22049/CCO.2023.28186.1469MaRDI QIDQ6917191zbMATH OpenFDO

Authors Razika Boutrig, Mustapha Chellali, Nacéra Meddah

Publication date 14 October 2025

Published in Communications in Combinatorics and Optimization (Search for Journal in Brave)

Copyright license Creative Commons Attribution-ShareAlike 4.0 International

Full work available at URL https://doi.org/10.22049/CCO.2023.28186.1469

zbMATH Keywords

independent vertex-edge dominationtreesvertex-edge dominationwell \textit{ve}-covered graphs

Mathematics Subject Classification ID

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

Cites work

• Bounds on the vertex-edge domination number of a tree
• scientific article; zbMATH DE number 4085682 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• Some covering concepts in graphs
• Vertex-edge domination
• Vertex-edge domination in graphs
• Vertex-edge domination in graphs
• WELL-COVERED GRAPHS: A SURVEY

Cited in

(1)

• Vertex-edge domination dot critical graphs

This page was built for publication: Well \textit{ve}-covered graphs

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