On total isolation in graphs

DOI10.1007/S00010-024-01057-1MaRDI QIDQ6991573zbMATH OpenFDO

Authors Geoffrey Boyer, Wayne Goddard, Michael A. Henning

Publication date 28 April 2025

Published in Aequationes Mathematicae (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/S00010-024-01057-1

zbMATH Keywords

isolating set in a graph

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Cites work

• \( K_{1 , 2}\)-isolation in graphs
• Disjoint isolating sets and graphs with maximum isolation number
• Graphs with isolation number equal to one third of the order
• scientific article; zbMATH DE number 4127268 (Why is no real title available?)
• scientific article; zbMATH DE number 1202982 (Why is no real title available?)
• scientific article; zbMATH DE number 1506511 (Why is no real title available?)
• Isolation of \(k\)-cliques
• Isolation of cycles
• Partial domination -- the isolation number of a graph
• Total domination and vertex-edge domination in tres
• Total vertex-edge domination
• Total vertex-edge domination in graphs: Complexity and algorithms
• Vertex-edge domination
• Vertex-edge domination in graphs
• Vertex-edge domination in graphs

Cited in

(2)

• Proof of a conjecture on isolation of cycles in graphs
• Solution to a problem on isolation of 3-vertex paths

This page was built for publication: On total isolation in graphs

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