Favaron, Odile A note on the open irredundance in a graph. (English) Zbl 0673.05083 Combinatorics, graph theory, and computing, Proc. 19th Southeast. Conf., Boca Raton/Fla. 1988, Congr. Numerantium 66, 316-318 (1988). Summary: [For the entire collection see Zbl 0665.00002.] We give a counterexample to a result of Farley and Shacham which states that in any graph oir\(\leq ir\) where ir (resp. oir) is the lower parameter of irredundance (resp. open irredundance) of the graph. Cited in 1 Document MSC: 05C99 Graph theory Keywords:open irredundance Citations:Zbl 0665.00002 PDFBibTeX XML