On the 2-rainbow independent domination numbers of some graphs
From MaRDI portal
Publication:6166940
Graph algorithms (graph-theoretic aspects) (05C85) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Coloring of graphs and hypergraphs (05C15) Graph operations (line graphs, products, etc.) (05C76) Max-plus and related algebras (15A80) Operations research and management science (90Bxx)
Recommendations
- On \(k\)-rainbow independent domination in graphs
- On the outer independent 2-rainbow domination number of Cartesian products of paths and cycles
- Independent 2-rainbow domination in graphs
- Independent rainbow domination of graphs
- 2-rainbow domination number of Cartesian products: \(C_{n}\square C_{3}\) and \(C_{n}\square C_{5}\)
Cites work
- scientific article; zbMATH DE number 1012624 (Why is no real title available?)
- scientific article; zbMATH DE number 1095171 (Why is no real title available?)
- scientific article; zbMATH DE number 1390094 (Why is no real title available?)
- A max version of the Perron-Frobenius theorem
- A note on the domination number of the Cartesian products of paths and cycles
- A theorem on tait colorings with an application to the generalized Petersen graphs
- Algebraic approach to fasciagraphs and rotagraphs
- Formulas for various domination numbers of products of paths and cycles.
- Handbook of product graphs
- Independent domination in graphs: A survey and recent results
- Independent rainbow domination of graphs
- Max-linear systems. Theory and algorithms.
- New formulas for the pentomino exclusion problem
- On \(k\)-rainbow independent domination in graphs
- On the 2-rainbow domination in graphs
- On the 2-rainbow independent domination numbers of some graphs
- On the spectrum in max algebra
- Paired-domination of Cartesian products of graphs and rainbow domination
- Polynomial convolutions in max-plus algebra
- Rainbow domination in the lexicographic product of graphs
- Rainbow domination on trees
- The matching polynomial of a polygraph
Cited in
(7)- 60 years of OR in Slovenia: development from a first conference to a vibrant community
- scientific article; zbMATH DE number 7227817 (Why is no real title available?)
- On rainbow domination of generalized Petersen graphs \(P ( c k , k )\)
- The 2-tuple dominating independent number of a random graph
- On some aspects of spectral theory for infinite bounded non-negative matrices in max algebra
- A sharp upper bound on the independent 2-rainbow domination in graphs with minimum degree at least two
- 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
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6166940)
