On the independence transversal total domination number of graphs

DOI10.1016/j.dam.2016.10.033zbMath1354.05103OpenAlexW2566231171MaRDI QIDQ505424

Abel Cabrera Martínez, José María Sigarreta-Almira, Ismael González Yero

Publication date: 23 January 2017

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2016.10.033

zbMATH Keywords

independence numbertotal domination numberindependence transversal total domination number

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items

Independent transversal total domination versus total domination in trees

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A survey of selected recent results on total domination in graphs
• On the corona of two graphs
• Independent transversal domination in graphs
• On the Algorithmic Complexity of Total Domination
• Total domination in graphs
• A new graph product and its spectrum
• Transversals of Vertex Partitions in Graphs
• Independent transversal dominating sets in graphs: Complexity and structural properties
• Domination-related parameters in rooted product graphs