Independent transversal dominating sets in graphs: Complexity and structural properties
From MaRDI portal
Publication:5279293
DOI10.2298/FIL1602293AzbMath1462.05267OpenAlexW2346086679MaRDI QIDQ5279293
Ismael González Yero, V. Samodivkin, Hossein Abdollahzadeh Ahangar
Publication date: 19 July 2017
Published in: Filomat (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2298/fil1602293a
Structural characterization of families of graphs (05C75) Transversal (matching) theory (05D15) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Related Items (7)
On the strong Roman domination number of graphs ⋮ Independent transversal domination in trees, products and under local changes to a graph ⋮ On upper bounds for the independent transversal domination number ⋮ THE GEODETIC FAULT TOLERANT DOMINATION NUMBER OF A GRAPH ⋮ On the independence transversal total domination number of graphs ⋮ The stability of independent transversal domination in trees ⋮ Corrigendum to: ``Independent transversal domination in graphs
This page was built for publication: Independent transversal dominating sets in graphs: Complexity and structural properties