R-annihilated and independent perfect neighborhood sets in chordal graphs
\(R\)-annihilated and independent perfect neighborhood sets in chordal graphs
Let \(\theta_i(G)\), \(\text{ra}(G)\) be the minimum cardinality of an independent perfect neighborhood set and an \(R\)-annihilated set, respectively. In 1999, Favaron and the author showed that the difference \(\theta_i(G)- \text{ra}(G)\) can be arbitrarily large; see \textit{O. Favaron} and \textit{J. Puech} [Discrete Math. 197/198, 269-284 (1999; Zbl 0957.05081)]. In the present paper, the author shows that the inequality \(\theta_i(G)\leq \text{ra}(G)\) holds for chordal graphs and for \(C_{1,2,2}\)-free graphs.
- k-Neighborhood-Covering and -Independence Problems for Chordal Graphs
- scientific article; zbMATH DE number 1229623
- On perfect neighborhood sets in graphs
- scientific article; zbMATH DE number 1416480
- Irredundant and perfect neighborhood sets in graphs and claw-free graphs
- A note on independence complexes of chordal graphs and dismantling
- Remarks on neighborhoods of independent sets and \((a,b,k)\)-critical graphs
- Independent sets in \(n\)-vertex \(k\)-chromatic \(\ell \)-connected graphs
- NEIGHBOURHOODS OF INDEPENDENT SETS FOR (a,b,k)-CRITICAL GRAPHS
- Chordal graphs and upper irredundance, upper domination and independence
This page was built for publication: \(R\)-annihilated and independent perfect neighborhood sets in chordal graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1974533)