Independent transversal dominating sets in graphs: complexity and structural properties
DOI10.2298/FIL1602293AzbMATH Open1462.05267OpenAlexW2346086679MaRDI QIDQ5279293FDOQ5279293
Authors: Vladimir Samodivkin, Ismael G. Yero, H. 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
Recommendations
Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Structural characterization of families of graphs (05C75) Transversal (matching) theory (05D15)
Cited In (14)
- Independent transversal equitable domination in graphs
- The independent transversal total domination number of some graphs
- Independent transversal domination in graphs
- THE GEODETIC FAULT TOLERANT DOMINATION NUMBER OF A GRAPH
- The stability of independent transversal domination in trees
- An algorithm for reading dependencies from the minimal undirected independence map of a graphoid that satisfies weak transitivity
- On upper bounds for the independent transversal domination number
- The independent transversal dombondage number of a graph
- A note on total co-independent domination in trees
- Independent transversal domination in trees, products and under local changes to a graph
- On the independence transversal total domination number of graphs
- Corrigendum to: ``Independent transversal domination in graphs
- On the strong Roman domination number of graphs
- Independent transversal domination number in complementary prisms
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)
