Disjoint isolating sets and graphs with maximum isolation number

DOI10.1016/j.dam.2024.05.022MaRDI QIDQ6585250zbMATH OpenFDO

Authors Geoffrey Boyer, Wayne Goddard

Publication date 9 August 2024

Published in Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.dam.2024.05.022

zbMATH Keywords

domaticextremal graphsgraph dominationisolation

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Extremal problems in graph theory (05C35) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Recommendations

• Graphs with isolation number equal to one third of the order
• Isolation in graphs
• \(k\)-isolation in graphs
• Isolation number of maximal outerplanar graphs

Cites work

• Bounds on the vertex-edge domination number of a tree
• Distance domination, guarding and covering of maximal outerplanar graphs
• Distance-2 domatic numbers of grid graphs
• Graphs with isolation number equal to one third of the order
• scientific article; zbMATH DE number 1109405 (Why is no real title available?)
• Isolation of \(k\)-cliques
• On separating cycles in graphs
• Partial domination -- the isolation number of a graph
• Vertex-edge domination
• Vertex-edge domination in cubic graphs
• Vertex-edge domination in graphs

Cited in

(15)

• Graphs with isolation number equal to one third of the order
• Solution to a 3-path isolation problem for subcubic graphs
• Isolation of regular graphs, stars and k-chromatic graphs
• The independent isolation number of a tree
• Bounds on independent isolation in graphs
• A characterization of graphs with maximum k-clique isolation number
• Proof of a conjecture on isolation of graphs dominated by a vertex
• On total isolation in graphs
• A characterization of graphs with maximum cycle isolation number
• Proof of a conjecture on isolation of cycles in graphs
• Upper bounds on the k-isolation number
• Solution to a problem on isolation of 3-vertex paths
• Isolation of non-triangle cycles in graphs
• Graphs with total isolation number equal to half the order
• Bounds on the game isolation number and exact values for paths and cycles

This page was built for publication: Disjoint isolating sets and graphs with maximum isolation number

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