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

DOI10.1016/j.dam.2018.12.034zbMath1407.05174OpenAlexW2911518297MaRDI QIDQ1735675

Chiuyuan Chen, Wu-Hsiung Lin, Kuan-Ting Chu

Publication date: 28 March 2019

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

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

zbMATH Keywords

stabilitydominationcactus graphsstrongly chordal graphstransferability

Mathematics Subject Classification ID

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

Related Items (1)

Transferable domination number of graphs

Cites Work

• Unnamed Item
• On recognition of threshold tolerance graphs and their complements
• Characterizing and computing the structure of clique intersections in strongly chordal graphs
• Domination, independent domination, and duality in strongly chordal graphs
• A tight bound on the number of mobile servers to guarantee transferability among dominating configurations
• A linear-time algorithm for paired-domination problem in strongly chordal graphs
• From a simple elimination ordering to a strong elimination ordering in linear time
• Characterizations of strongly chordal graphs
• A linear algorithm for finding a minimum dominating set in a cactus
• Dominating sets in perfect graphs
• A linear algorithm for the domination number of a tree
• Solving covering problems and the uncapacitated plant location problem on trees
• Characterizations of totally balanced matrices
• On the Algorithmic Complexity of Total Domination
• The k-Domination and k-Stability Problems on Sun-Free Chordal Graphs
• Doubly Lexical Orderings of Matrices
• Three Partition Refinement Algorithms
• Dominating Sets in Chordal Graphs

This page was built for publication: Mutual transferability for \((F, B, R)\)-domination on strongly chordal graphs and cactus graphs