\( K_{1 , 2}\)-isolation in graphs

DOI10.1016/j.dam.2021.08.013zbMath1473.05235OpenAlexW3194494288MaRDI QIDQ2231782

Gang Zhang, Baoyindureng Wu

Publication date: 30 September 2021

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2021.08.013

zbMATH Keywords

dominationisolation numberpartial domination

Mathematics Subject Classification ID

Structural characterization of families of graphs (05C75) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (10)

Isolation of the diamond graph ⋮ \( P_5\)-isolation in graphs ⋮ 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 ⋮ Admissible property of graphs in terms of radius ⋮ Admissible property of graphs in terms of independence number

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• \(k\)-domination and \(k\)-independence in graphs: A survey
• Independent domination in subcubic bipartite graphs of girth at least six
• A survey of selected recent results on total domination in graphs
• Independent domination in graphs: A survey and recent results
• Independent domination in bipartite cubic graphs
• Isolation of cycles
• Isolation of \(k\)-cliques
• Partial domination of maximal outerplanar graphs
• Isolation number of maximal outerplanar graphs
• Partial domination - the isolation number of a graph

This page was built for publication: \( K_{1 , 2}\)-isolation in graphs