Admissible property of graphs in terms of radius

DOI10.1007/S00373-021-02431-5zbMath1479.05290OpenAlexW4200528296MaRDI QIDQ2062891

Baoyindureng Wu, Huijuan Yu

Publication date: 3 January 2022

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

Full work available at URL: https://doi.org/10.1007/s00373-021-02431-5

zbMATH Keywords

dominationisolation number\(\mathcal{P}\)-admission numberpartial domination

Mathematics Subject Classification ID

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

Related Items (8)

Isolation of the diamond graph ⋮ 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 independence number

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• \(k\)-domination and \(k\)-independence in graphs: A survey
• A survey of selected recent results on total domination in graphs
• Independent domination in graphs: A survey and recent results
• Isolation of cycles
• Isolation of \(k\)-cliques
• Partial domination of maximal outerplanar graphs
• \( 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: Admissible property of graphs in terms of radius