Independent domination, colorings and the fractional idomatic number of a graph
DOI10.1016/J.AMC.2020.125340OpenAlexW3022382553WikidataQ130483919 ScholiaQ130483919MaRDI QIDQ2185446FDOQ2185446
Authors: Michael A. Henning, Wayne Goddard 
Publication date: 4 June 2020
Published in: Applied Mathematics and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.amc.2020.125340
Recommendations
- Outer invariance entropy for linear systems on Lie groups
- Outer invariance entropy for discrete-time linear systems on Lie groups
- Topological and invariance entropy for infinite-dimensional linear systems
- Affine and bilinear systems on Lie groups
- Non-autonomous systems on Lie groups and their topological entropy
Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Coloring of graphs and hypergraphs (05C15)
Cites Work
- Dynamic coloring and list dynamic coloring of planar graphs
- Title not available (Why is that?)
- Independent domination in graphs: A survey and recent results
- On \(r\)-dynamic coloring of graphs
- On domination and independent domination numbers of a graph
- Two relations between the parameters of independence and irredundance
- On independent domination in planar cubic graphs
- Title not available (Why is that?)
- On well-covered triangulations. I
- Dominating sets in planar graphs
- Disjoint independent dominating sets in graphs
- Coverings by minimal transversals
- Deploying robots with two sensors in \(K_{1,6}\)-free graphs
- A counterexample to montgomery's conjecture on dynamic colourings of regular graphs
- Title not available (Why is that?)
- Thoroughly dispersed colorings
- Acyclic total dominating sets in cubic graphs
Cited In (7)
- Independent domination in outerplanar graphs
- Outer invariance entropy for linear systems on Lie groups
- Title not available (Why is that?)
- Fractional independence and fractional domination chain in graphs
- Partial domination and irredundance numbers in graphs
- Fractional Domatic, Idomatic, and Total Domatic Numbers of a Graph
- An extension of locating-total domination problem and its complexity
This page was built for publication: Independent domination, colorings and the fractional idomatic number of a graph
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2185446)
