Admissible property of graphs in terms of independence number

DOI10.1007/s40840-022-01335-8zbMath1500.05049OpenAlexW4283120775MaRDI QIDQ2082373

Xinying Hua, Hong-Bo Hua

Publication date: 4 October 2022

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

Full work available at URL: https://doi.org/10.1007/s40840-022-01335-8

zbMATH Keywords

independence numberboundisolation numberpartial domination\({\mathcal{I}}_1 \)-admission number

Mathematics Subject Classification ID

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

Related Items (4)

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

Cites Work

• Bibliography on domination in graphs and some basic definitions of domination parameters
• A survey of selected recent results on total domination in graphs
• Independent domination in graphs: A survey and recent results
• Admissible property of graphs in terms of radius
• Isolation of \(k\)-cliques. II
• Isolation of cycles
• Isolation of \(k\)-cliques
• Partial domination of maximal outerplanar graphs
• \( K_{1 , 2}\)-isolation in graphs
• Towards a theory of domination in graphs
• Partial domination - the isolation number of a graph

This page was built for publication: Admissible property of graphs in terms of independence number