Isolation of the diamond graph

DOI10.1007/s40840-022-01248-6zbMath1487.05201arXiv2110.08724OpenAlexW4210422131MaRDI QIDQ2134972

Jingru Yan

Publication date: 4 May 2022

Published in: Bulletin of the Malaysian Mathematical Sciences Society. Second Series (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2110.08724

zbMATH Keywords

isolation numberdiamond graphisolating set

Mathematics Subject Classification ID

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

Related Items (6)

Isolation of connected graphs ⋮ 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 ⋮ Extensions of the Art Gallery Theorem

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Admissible property of graphs in terms of radius
• Isolation of cycles
• Isolation of \(k\)-cliques
• Partial domination of maximal outerplanar graphs
• Inequalities between the \(K_k\)-isolation number and the independent \(K_k\)-isolation number of a graph
• \( K_{1 , 2}\)-isolation in graphs
• Isolation number of maximal outerplanar graphs
• Partial domination - the isolation number of a graph

This page was built for publication: Isolation of the diamond graph