K₁, 2-isolation number of claw-free cubic graphs
From MaRDI portal
Publication:6131040
Recommendations
Cites work
- scientific article; zbMATH DE number 1095171 (Why is no real title available?)
- Admissible property of graphs in terms of independence number
- Admissible property of graphs in terms of radius
- Claw-free graphs---a survey
- Graph theory
- Graphs \(G\) in which \(G-N[v]\) has a prescribed property for each vertex \(v\)
- Graphs in which \(G - N[v]\) is a cycle for each vertex \(v\)
- Isolation number of maximal outerplanar graphs
- Isolation of \(k\)-cliques
- Isolation of cycles
- Isolation of the diamond graph
- Locating-total domination in claw-free cubic graphs
- Paired domination in graphs: a survey and recent results
- Partial domination -- the isolation number of a graph
- Partial domination of maximal outerplanar graphs
- Semitotal domination in claw-free cubic graphs
- \( K_{1 , 2}\)-isolation in graphs
- \( P_5\)-isolation in graphs
- \(k\)-domination and \(k\)-independence in graphs: A survey
This page was built for publication: \(K_{1, 2}\)-isolation number of claw-free cubic graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6131040)