Algorithmic aspects of \P_k\-isolation in graphs and extremal graphs for a \P₃\-isolation bound

DOI10.1016/J.IPL.2024.106521zbMATH Open1547.0522MaRDI QIDQ6602332FDOQ6602332

Authors: Jie Chen, Yi-Ping Liang, Cai-Xia Wang, S. J. Xu 

Publication date: 11 September 2024

Published in: Information Processing Letters (Search for Journal in Brave)

Recommendations

• A note on the \(P_3\)-isolation number of a graph
• \( K_{1 , 2}\)-isolation in graphs
• \( P_5\)-isolation in graphs
• \(k\)-isolation in graphs
• Isolation in graphs

zbMATH Keywords

NP-completenessdominationextremal graphs\(\mathcal{F}\)-isolation number

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) 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
• Independent domination in graphs: A survey and recent results
• Dominating Sets in Chordal Graphs
• \( K_{1 , 2}\)-isolation in graphs
• Isolation number of maximal outerplanar graphs
• Isolation of connected graphs
• Partial domination of maximal outerplanar graphs
• Extensions of the Art Gallery Theorem
• Isolation of cycles
• Isolation of \(k\)-cliques
• Partial domination -- the isolation number of a graph

Cited In (1)

• A note on the \(P_3\)-isolation number of a graph

This page was built for publication: Algorithmic aspects of \(\{P_k\}\)-isolation in graphs and extremal graphs for a \(\{P_3\}\)-isolation bound

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6602332)