Domination complement tree graphs

DOI10.14317/JAMI.2025.723MaRDI QIDQ6912708zbMATH OpenFDO

Authors M. Sivasankari, M. Yamuna

Publication date 22 October 2025

Published in Journal of Applied Mathematics \& Informatics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.14317/JAMI.2025.723

zbMATH Keywords

dominating setMATLABnon-planarplanartree

Mathematics Subject Classification ID

Trees (05C05) Planar graphs; geometric and topological aspects of graph theory (05C10) Paths and cycles (05C38) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Graph algorithms (graph-theoretic aspects) (05C85)

Cites work

• -chromatic partition in planar graph characterization
• L(3, 2, 1)-labeling of certain planar graphs
• A note on bounds for the broadcast domination number of graphs
• A survey on graphs which have equal domination and closed neighbourhood packing numbers
• Domination and dominator colorings in planar graphs with small diameter
• Domination in planar graphs with small diameter II.
• Domination of triangulated discs and maximal outerplanar graphs
• scientific article; zbMATH DE number 1095171 (Why is no real title available?)
• scientific article; zbMATH DE number 3290993 (Why is no real title available?)
• Large matchings in maximal 1-planar graphs
• Relaxation of Wegner's planar graph conjecture for maximum degree 4
• Sur le problème des courbes gauches en topologie.
• The theorem on planar graphs

This page was built for publication: Domination complement tree graphs

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