The independent transversal total domination number of some graphs

MaRDI QIDQ5133085zbMATH OpenFDO

Authors Jun Yue, Wei Ge

Publication date 12 November 2020

zbMATH Keywords

polynomial-time algorithmtotal dominating setindependence numbercographsindependent transversal total dominating set

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Structural characterization of families of graphs (05C75)

Recommendations

• On the independence transversal total domination number of graphs
• Independent transversal total domination versus total domination in trees
• Transversal total domination in graphs
• Independent transversal domination in graphs
• Independent transversal dominating sets in graphs: complexity and structural properties

Cited in

(7)

• Independent transversals in \(r\)-partite graphs
• Independent transversal total domination versus total domination in trees
• Corrigendum to: ``Independent transversal domination in graphs
• Transversal total domination in graphs
• scientific article; zbMATH DE number 6612570 (Why is no real title available?)
• On the independence transversal total domination number of graphs
• Independent transversal dominating sets in graphs: complexity and structural properties

This page was built for publication: The independent transversal total domination number of some graphs

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