Isolation of k-cliques. II

DOI10.1016/J.DISC.2021.112641MaRDI QIDQ2138948zbMATH OpenOpenAlexFDO

Authors Peter Borg, Kurt Fenech, P. Kaemawichanurat

Publication date 17 May 2022

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.disc.2021.112641

zbMATH Keywords

cliqueclosed neighbourhooddominating setisolating set

Mathematics Subject Classification ID

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

Recommendations

• Isolation of \(k\)-cliques
• Inequalities between the \(K_k\)-isolation number and the independent \(K_k\)-isolation number of a graph
• \( K_{1 , 2}\)-isolation in graphs
• Independence and k-domination in graphs
• Partial domination -- the isolation number of a graph

Cites work

• Bibliography on domination in graphs and some basic definitions of domination parameters
• Domination-balanced graphs
• scientific article; zbMATH DE number 3159208 (Why is no real title available?)
• scientific article; zbMATH DE number 3172309 (Why is no real title available?)
• scientific article; zbMATH DE number 3596896 (Why is no real title available?)
• scientific article; zbMATH DE number 1095171 (Why is no real title available?)
• scientific article; zbMATH DE number 1095172 (Why is no real title available?)
• scientific article; zbMATH DE number 1179517 (Why is no real title available?)
• scientific article; zbMATH DE number 3221976 (Why is no real title available?)
• Introduction to ``Topics on Domination
• Isolation of \(k\)-cliques
• Isolation of cycles
• On graphs having domination number half their order
• Partial domination -- the isolation number of a graph
• Towards a theory of domination in graphs

Cited in

(33)

• Admissible property of graphs in terms of independence number
• Isolation of cycles
• Isolation of \(k\)-cliques
• Inequalities between the \(K_k\)-isolation number and the independent \(K_k\)-isolation number of a graph
• Extensions of the Art Gallery Theorem
• Cliques in k-connected graphs
• Partial domination -- the isolation number of a graph
• Isolation of connected graphs
• A sharp upper bound on the cycle isolation number of graphs
• Partial domination and irredundance numbers in graphs
• Cycle isolation of graphs with small girth
• A note on the cycle isolation number of graphs
• Graphs with isolation number equal to one third of the order
• Extremal graphs for the \(K_{1,2}\)-isolation number of graphs
• Isolation of regular graphs and \(k\)-chromatic graphs
• \(k\)-isolation in graphs
• Isolation of squares in graphs
• On the cycle isolation number of triangle-free graphs
• A note on the \(P_3\)-isolation number of a graph
• Solution to a 3-path isolation problem for subcubic graphs
• Isolation of regular graphs, stars and k-chromatic graphs
• The probabilistic upper bounds on the isolation number of a graph
• Cycle isolation in graphs
• Total isolation of k-cliques in a graph
• Isolation of connected graphs in terms of size
• A characterization of graphs with maximum k-clique isolation number
• Proof of a conjecture on isolation of graphs dominated by a vertex
• A characterization of graphs with maximum cycle isolation number
• Proof of a conjecture on isolation of cycles in graphs
• Upper bounds on the k-isolation number
• Solution to a problem on isolation of 3-vertex paths
• Isolation of non-triangle cycles in graphs
• Graphs with total isolation number equal to half the order

This page was built for publication: Isolation of \(k\)-cliques. II

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