\(K_{1, 2}\)-isolation number of claw-free cubic graphs

DOI10.1007/s40840-024-01672-wMaRDI QIDQ6131040

Yueqin Yin, Xinhui An, Baoyindureng Wu

Publication date: 4 April 2024

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

zbMATH Keywords

claw-free cubic graphpartial domination\(K_{1, 2}\)-isolation number

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Structural characterization of families of graphs (05C75) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Connectivity (05C40)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Locating-total domination in claw-free cubic graphs
• \(k\)-domination and \(k\)-independence in graphs: A survey
• Claw-free graphs---a survey
• Graphs in which \(G - N[v\) is a cycle for each vertex \(v\)]
• Admissible property of graphs in terms of radius
• Admissible property of graphs in terms of independence number
• Isolation of the diamond graph
• Graphs \(G\) in which \(G-N[v\) has a prescribed property for each vertex \(v\)]
• 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
• Semitotal domination in claw-free cubic graphs
• \( P_5\)-isolation in graphs

This page was built for publication: \(K_{1, 2}\)-isolation number of claw-free cubic graphs