Open irredundance and maximum degree in graphs
From MaRDI portal
Publication:998417
DOI10.1016/J.DISC.2007.10.002zbMATH Open1207.05095OpenAlexW2040241884MaRDI QIDQ998417FDOQ998417
Authors: E. J. Cockayne, Odile Favaron, Stephen Finbow, Christina M. Mynhardt 
Publication date: 28 January 2009
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2007.10.002
Recommendations
Extremal problems in graph theory (05C35) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- The Private Neighbor Cube
- Irredundance and Maximum Degree in Graphs
- Title not available (Why is that?)
- Ramsey properties of generalised irredundant sets in graphs
- The irredundance number and maximum degree of a graph
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- OC-irredundance, CO-irredundance and maximum degree in trees
Cited In (8)
- A lower bound for the CO-irredundance number of a graph
- The irredundance number and maximum degree of a graph
- The private neighbor concept
- OC-irredundance, CO-irredundance and maximum degree in trees
- Irredundance
- On the equivalence of the upper open irredundance and fractional upper open irredundance numbers of a graph
- Title not available (Why is that?)
- Title not available (Why is that?)
This page was built for publication: Open irredundance and maximum degree in graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q998417)
