Graphs with isolation number equal to one third of the order

DOI10.1016/J.DISC.2024.113903arXiv2307.11520MaRDI QIDQ6204326FDOQ6204326

Authors: Magdalena Lemańska, Mercè Mora, María José Souto Salorio 

Publication date: 27 March 2024

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

Full work available at URL: https://arxiv.org/abs/2307.11520

Recommendations

• Disjoint isolating sets and graphs with maximum isolation number
• Isolation in graphs
• \( K_{1 , 2}\)-isolation in graphs
• \(k\)-isolation in graphs

zbMATH Keywords

dominationunicyclic graphsisolationblock graphs

Mathematics Subject Classification ID

Combinatorial aspects of block designs (05B05) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Cites Work

• Title not available (Why is that?)
• Domination-balanced graphs
• Title not available (Why is that?)
• On graphs having domination number half their order
• Isolation of cycles
• Isolation of \(k\)-cliques
• Partial domination -- the isolation number of a graph
• Isolation of \(k\)-cliques. II

Cited In (4)

• Disjoint isolating sets and graphs with maximum isolation number
• \(k\)-isolation in graphs
• A note on the \(P_3\)-isolation number of a graph
• \(K_{1, 2}\)-isolation number of claw-free cubic graphs

This page was built for publication: Graphs with isolation number equal to one third of the order

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