Irredundant and perfect neighbourhood sets in trees
From MaRDI portal
Publication:1584343
Recommendations
- On perfect neighborhood and irredundant sets in trees
- scientific article; zbMATH DE number 1416480
- Irredundant and perfect neighborhood sets in graphs and claw-free graphs
- scientific article; zbMATH DE number 1778141
- scientific article; zbMATH DE number 1229623
- On perfect neighborhood sets in graphs
- Trees with large neighborhood total domination number
- On independent \([1, 2]\)-sets in trees
- A lower bound for the irredundance number of trees
- A Note on Independent Sets in Trees
Cites work
Cited in
(7)- Irredundant and perfect neighborhood sets in graphs and claw-free graphs
- On perfect neighborhood sets in graphs
- The private neighbor concept
- scientific article; zbMATH DE number 2042776 (Why is no real title available?)
- scientific article; zbMATH DE number 1416480 (Why is no real title available?)
- On perfect neighborhood and irredundant sets in trees
- Enumeration and maximum number of maximal irredundant sets for chordal graphs
This page was built for publication: Irredundant and perfect neighbourhood sets in trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1584343)