Edge-vertex domination of acyclic trapezoid graphs: algorithm and complexity

DOI10.29229/UZMJ.2024-2-1MaRDI QIDQ6599559zbMATH OpenFDO

Authors Amita Samanta Adhya, Sukumar Mondal, Sambhu Charan Barman

Publication date 6 September 2024

Published in Uzbek Mathematical Journal (Search for Journal in Brave)

Full work available at URL https://doi.org/10.29229/UZMJ.2024-2-1

zbMATH Keywords

acyclic trapezoid graphalgorithmedge-vertex domination

Mathematics Subject Classification ID

Distance in graphs (05C12) Enumeration in graph theory (05C30) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Edge-vertex domination on interval graphs
• Algorithmic aspects of vertex-edge domination in some graphs.
• Linear algorithms for edge-vertex domination in trees
• Edge-vertex domination in trees
• Total vertex-edge domination in graphs: Complexity and algorithms

Cited in

(1)

• Edge-vertex domination on interval graphs

This page was built for publication: Edge-vertex domination of acyclic trapezoid graphs: algorithm and complexity

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