Independent transversal dominating sets in graphs: complexity and structural properties
From MaRDI portal
Recommendations
Cited in
(17)- On upper bounds for the independent transversal domination number
- Corrigendum to: ``Independent transversal domination in graphs
- Independent transversal domination in trees, products and under local changes to a graph
- On the strong Roman domination number of graphs
- An algorithm for reading dependencies from the minimal undirected independence map of a graphoid that satisfies weak transitivity
- Independent transversal domination in graphs
- The independent transversal dombondage number of a graph
- On the independence transversal total domination number of graphs
- The independent transversal total domination number of some graphs
- Independent transversal equitable domination in graphs
- The stability of independent transversal domination in trees
- THE GEODETIC FAULT TOLERANT DOMINATION NUMBER OF A GRAPH
- Independent transversal domination number in complementary prisms
- A note on total co-independent domination in trees
- Transversal total hop domination in graphs
- More on independent transversal domination
- The edge geodetic fault tolerant domination number of a graph
This page was built for publication: Independent transversal dominating sets in graphs: complexity and structural properties
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5279293)