Irredundant and perfect neighborhood sets in graphs and claw-free graphs

DOI10.1016/S0012-365X(99)90073-0MaRDI QIDQ1292835zbMATH OpenFDO

Authors Odile Favaron, Joël Puech

Publication date 15 March 2001

Published in Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

claw-free graphsirredundant setperfect neighborhood set

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Recommendations

• scientific article; zbMATH DE number 1416480
• Independence and upper irredundance in claw-free graphs
• Irredundant and perfect neighbourhood sets in trees
• \(R\)-annihilated and independent perfect neighborhood sets in chordal graphs

Cites work

• scientific article; zbMATH DE number 1208728 (Why is no real title available?)
• scientific article; zbMATH DE number 1416480 (Why is no real title available?)
• Irredundance perfect andP6-free graphs
• Irredundant and perfect neighbourhood sets in trees
• Stability, domination and irredundance in a graph

Cited in

(7)

• On perfect neighborhood and irredundant sets in trees
• scientific article; zbMATH DE number 1416480 (Why is no real title available?)
• Independence and upper irredundance in claw-free graphs
• The private neighbor concept
• Irredundant and perfect neighbourhood sets in trees
• Weakly clique irreducibility of NEPS of two graphs
• \(R\)-annihilated and independent perfect neighborhood sets in chordal graphs

This page was built for publication: Irredundant and perfect neighborhood sets in graphs and claw-free graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1292835)