Isolation of connected graphs in terms of size

DOI10.1007/S00373-025-02946-1MaRDI QIDQ6936997zbMATH OpenFDO

Authors Ayman El Zein, Manar Shreif

Publication date 28 August 2025

Published in Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/S00373-025-02946-1

zbMATH Keywords

closed neighborhoodconnected graphisolation numbernumber of edges

Mathematics Subject Classification ID

Enumeration in graph theory (05C30) Connectivity (05C40) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Cites work

• \( K_{1 , 2}\)-isolation in graphs
• \( P_5\)-isolation in graphs
• \(k\)-isolation in graphs
• A note on the \(P_3\)-isolation number of a graph
• Extensions of the Art Gallery Theorem
• Isolation number of maximal outerplanar graphs
• Isolation of \(k\)-cliques
• Isolation of \(k\)-cliques. II
• Isolation of connected graphs
• Isolation of cycles
• Isolation of squares in graphs
• Partial domination -- the isolation number of a graph
• Partial domination of maximal outerplanar graphs
• Proof of a conjecture on isolation of graphs dominated by a vertex

This page was built for publication: Isolation of connected graphs in terms of size

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