A lower bound for the CO-irredundance number of a graph

Extremal problems in graph theory (05C35) Generalized Ramsey theory (05C55) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Review text

A set \(X\) of vertices of a graph \(G\) is CO-irredundant if for every \(x \in X\), \(N[x] - N(X - \{x\}) \neq \emptyset\). It is shown that if \(X\) is a CO-irredundant set of a graph \(G\) and \(S = V(G) - N(X)\), then \(X\) is a maximal CO-irredundant set if and only if for every \(v \in N[S] - X\), there exists an \(x_v \in X\) such that \(pn(x_v,X) \subseteq N(v)\), where \(pn(x_v,X)\) denotes the private neighbors of \(x_v\) relative to \(X\). Also the cardinality of maximal CO-irredundant sets in a graph of order \(n\) with maximum degree \(\Delta\) are determined.

Recommendations

Cites work

Cited in

(3)

This page was built for publication: A lower bound for the CO-irredundance number of a graph

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