Extremal graphs for the \(K_{1,2}\)-isolation number of graphs
From MaRDI portal
Publication:6564850
DOI10.1007/S40840-024-01711-6zbMATH Open1542.05137MaRDI QIDQ6564850
Jingshu Zhang, Qing Cui, Lingping Zhong
Publication date: 1 July 2024
Published in: Bulletin of the Malaysian Mathematical Sciences Society. Second Series (Search for Journal in Brave)
Extremal problems in graph theory (05C35) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- A survey of selected recent results on total domination in graphs
- Admissible property of graphs in terms of radius
- Admissible property of graphs in terms of independence number
- Isolation of the diamond graph
- Isolation of \(k\)-cliques. II
- 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
- Total Domination in Graphs
- Partial domination - the isolation number of a graph
- Partial domination and irredundance numbers in graphs
This page was built for publication: Extremal graphs for the \(K_{1,2}\)-isolation number of graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6564850)
