Admissible property of graphs in terms of independence number
For a graph \(G\) and a property \(\mathcal{P}\), a subset \(D\subseteq V(G)\) is said to be a \(\mathcal{P}\)-admissible set of \(G\) if \(G-N_{G}[D]\) admits the property \(\mathcal{P}\), where \(N_{G}[D]= D\cup N_{G}(D)\). The \(\mathcal{P}\)-admission number of \(G\) is the cardinality of a minimum \(\mathcal{P}\)-admissible set in \(G\). A graph \(G\) is said to have the property \(\mathcal{I}_{k}\) if the independence number of each component of \(G\) is at most \(k\). As a generalization of the domination number and isolation number, the \(\mathcal{P}\)-admission number was proposed and investigated by \textit{H. Yu} and \textit{B. Wu} [Graphs Comb. 38, No. 1, Paper No. 6, 9 p. (2022; Zbl 1479.05290)]. In this paper, the authors establish a sharp upper bound for \(\mathcal{I}_{1}\)-admission number of generally connected graphs.
- \( K_{1 , 2}\)-isolation in graphs
- A survey of selected recent results on total domination in graphs
- Admissible property of graphs in terms of radius
- Bibliography on domination in graphs and some basic definitions of domination parameters
- Independent domination in graphs: A survey and recent results
- Isolation of \(k\)-cliques
- Isolation of \(k\)-cliques. II
- Isolation of cycles
- Partial domination -- the isolation number of a graph
- Partial domination of maximal outerplanar graphs
- Towards a theory of domination in graphs
- Admissible property of graphs in terms of radius
- A sharp upper bound on the cycle isolation number of graphs
- \(K_{1, 2}\)-isolation number of claw-free cubic graphs
- Cycle isolation of graphs with small girth
- A note on the cycle isolation number of graphs
- Extremal graphs for the \(K_{1,2}\)-isolation number of graphs
- \(k\)-isolation in graphs
- On the cycle isolation number of triangle-free graphs
- Cycle isolation in graphs
- A characterization of graphs with maximum k-clique isolation number
- A characterization of graphs with maximum cycle isolation number
- Proof of a conjecture on isolation of cycles in graphs
This page was built for publication: Admissible property of graphs in terms of independence number
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2082373)
