Open irredundance and maximum degree in graphs
From MaRDI portal
(Redirected from Publication:998417)
Recommendations
Cites work
- scientific article; zbMATH DE number 3859049 (Why is no real title available?)
- scientific article; zbMATH DE number 3869363 (Why is no real title available?)
- scientific article; zbMATH DE number 4210179 (Why is no real title available?)
- scientific article; zbMATH DE number 4101267 (Why is no real title available?)
- scientific article; zbMATH DE number 1208728 (Why is no real title available?)
- scientific article; zbMATH DE number 1095171 (Why is no real title available?)
- scientific article; zbMATH DE number 1416461 (Why is no real title available?)
- Irredundance and Maximum Degree in Graphs
- OC-irredundance, CO-irredundance and maximum degree in trees
- Ramsey properties of generalised irredundant sets in graphs
- The Private Neighbor Cube
- The irredundance number and maximum degree of a graph
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
- scientific article; zbMATH DE number 3869363 (Why is no real title available?)
- scientific article; zbMATH DE number 4101267 (Why is no real title available?)
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)