Transferable domination number of graphs

DOI10.1016/J.DAM.2022.02.004zbMATH Open1485.05131OpenAlexW4220700119MaRDI QIDQ833006FDOQ833006

Authors: N. E. Zubov 

Publication date: 28 March 2022

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

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

Recommendations

• Mutual transferability for \((F, B, R)\)-domination on strongly chordal graphs and cactus graphs
• Path transferability of graphs with bounded minimum degree
• Transversal domination in graphs
• Transversal domination in double graphs
• Publication:4862104

zbMATH Keywords

griddomination numberdominating settransferable domination number

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Connectivity (05C40)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• The bondage number of a graph
• Title not available (Why is that?)
• The domination number of grids
• Mutual transferability for \((F, B, R)\)-domination on strongly chordal graphs and cactus graphs
• A tight bound on the number of mobile servers to guarantee transferability among dominating configurations

Cited In (3)

• Path transferability of planar graphs
• Mutual transferability for \((F, B, R)\)-domination on strongly chordal graphs and cactus graphs
• Path transferability of graphs with bounded minimum degree

This page was built for publication: Transferable domination number of graphs

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