A tight bound on the number of mobile servers to guarantee transferability among dominating configurations

DOI10.1016/j.dam.2009.12.007zbMath1205.68033OpenAlexW2053842969MaRDI QIDQ972325

Satoshi Fujita

Publication date: 25 May 2010

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

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

zbMATH Keywords

Hamiltonian graphdominating setpeer-to-peer systemmobile serverstransferability

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (2)

Transferable domination number of graphs ⋮ Mutual transferability for \((F, B, R)\)-domination on strongly chordal graphs and cactus graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On approximating the minimum independent dominating set
• The weighted perfect domination problem
• On the domatic number of interval graphs
• Finding a minimum independent dominating set in a permutation graph
• Linear algorithm for domatic number problem on interval graphs
• Approximation algorithms for connected dominating sets
• Dominating sets in planar graphs
• Towards a theory of domination in graphs
• A Study on r-Configurations---A Resource Assignment Problem on Graphs
• The Domatic Number Problem in Interval Graphs

This page was built for publication: A tight bound on the number of mobile servers to guarantee transferability among dominating configurations