K₁, 2-isolation number of claw-free cubic graphs

DOI10.1007/S40840-024-01672-WMaRDI QIDQ6131040FDOQ6131040

Authors: 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) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Connectivity (05C40) Structural characterization of families of graphs (05C75)

Cites Work

• Graph theory
• Title not available (Why is that?)
• Claw-free graphs---a survey
• \(k\)-domination and \(k\)-independence in graphs: A survey
• Locating-total domination in claw-free cubic graphs
• Semitotal domination in claw-free cubic graphs
• Paired domination in graphs: a survey and recent results
• Isolation of the diamond graph
• \( K_{1 , 2}\)-isolation in graphs
• Isolation number of maximal outerplanar graphs
• Partial domination of maximal outerplanar graphs
• Graphs in which \(G - N[v]\) is a cycle for each vertex \(v\)
• Isolation of cycles
• Isolation of \(k\)-cliques
• Partial domination - the isolation number of a graph
• Admissible property of graphs in terms of radius
• Admissible property of graphs in terms of independence number
• Graphs \(G\) in which \(G-N[v]\) has a prescribed property for each vertex \(v\)
• \( P_5\)-isolation in graphs

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)