On the 2-rainbow independent domination numbers of some graphs
DOI10.1007/s10100-023-00840-wOpenAlexW4321237781MaRDI QIDQ6166940
Aljoša Peperko, Janez Žerovnik, Boštjan Gabrovšek
Publication date: 4 August 2023
Published in: CEJOR. Central European Journal of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10100-023-00840-w
Coloring of graphs and hypergraphs (05C15) Graph algorithms (graph-theoretic aspects) (05C85) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Max-plus and related algebras (15A80) Graph operations (line graphs, products, etc.) (05C76) Operations research and management science (90Bxx)
Related Items (2)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the spectrum in max algebra
- Rainbow domination on trees
- The matching polynomial of a polygraph
- A max version of the Perron-Frobenius theorem
- Algebraic approach to fasciagraphs and rotagraphs
- Independent domination in graphs: A survey and recent results
- Polynomial convolutions in max-plus algebra
- On \(k\)-rainbow independent domination in graphs
- Independent rainbow domination of graphs
- Rainbow domination in the lexicographic product of graphs
- On the 2-rainbow domination in graphs
- Paired-domination of Cartesian products of graphs and rainbow domination
- Max-linear Systems: Theory and Algorithms
- A theorem on tait colorings with an application to the generalized Petersen graphs
- On the 2-rainbow independent domination numbers of some graphs
This page was built for publication: On the 2-rainbow independent domination numbers of some graphs