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)

zbMATH Keywords

graph dominationextremal graphsisolationdomatic

Mathematics Subject Classification ID

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

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

• scientific article; zbMATH DE number 1109405 (Why is no real title available?)
• 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
• 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

(1)

• Graphs with isolation number equal to one third of the order

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)