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

DOI10.1016/S0012-365X(99)90073-0zbMATH Open0957.05081MaRDI QIDQ1292835FDOQ1292835

Authors: Odile Favaron, Joël Puech 

Publication date: 15 March 2001

Published in: Discrete Mathematics (Search for Journal in Brave)

Recommendations

• Publication:4943531
• 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

zbMATH Keywords

claw-free graphsirredundant setperfect neighborhood set

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Stability, domination and irredundance in a graph
• Irredundance perfect andP6-free graphs
• Irredundant and perfect neighbourhood sets in trees
• Title not available (Why is that?)

Cited In (7)

• On perfect neighborhood and irredundant sets in trees
• Title not available (Why is that?)
• Independence and upper irredundance in claw-free graphs
• Irredundant and perfect neighbourhood sets in trees
• The Private Neighbor Concept
• 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)