Please use this identifier to cite or link to this item:
https://www.um.edu.mt/library/oar/handle/123456789/105077| Title: | Isolation of k-cliques II |
| Authors: | Borg, Peter Fenech, Kurt Kaemawichanurat, Pawaton |
| Keywords: | Mathematics Domination (Graph theory) Graph theory |
| Issue Date: | 2022 |
| Publisher: | Elsevier B.V. |
| Citation: | Borg, P., Fenech, K., & Kaemawichanurat, P. (2022). Isolation of k-cliques II. Discrete Mathematics, 345(7), 112641. |
| Abstract: | For any positive integer k and any graph G, let ι(G,k) denote the size of a smallest set D of vertices of G such that the graph obtained from G by deleting the closed neighbourhood of D contains no k-clique. Thus, ι(G, 1) is the domination number of G. We prove that if m is the number of edges of a connected graph G that is not a k-clique, then ι(G,k) ≤ m+1/ (k 2)+2. We also characterize the graphs that attain the bound |
| URI: | https://www.um.edu.mt/library/oar/handle/123456789/105077 |
| Appears in Collections: | Scholarly Works - FacSciMat |
Files in This Item:
| File | Description | Size | Format | |
|---|---|---|---|---|
| Isolation_of_k_cliques_II_2022.pdf Restricted Access | 299.35 kB | Adobe PDF | View/Open Request a copy |
Items in OAR@UM are protected by copyright, with all rights reserved, unless otherwise indicated.