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

DOI10.1016/J.DAM.2018.12.034MaRDI QIDQ1735675zbMATH OpenOpenAlexFDO

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

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

cactus graphsdominationstabilitystrongly chordal graphstransferability

Mathematics Subject Classification ID

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

Recommendations

• Transferable domination number of graphs
• Rainbow domination and related problems on strongly chordal graphs
• Fair total domination number in cactus graphs
• Fair domination number in cactus graphs
• On the domination, strong and weak domination in transformation graph \(G^{xy-}\)

Cites work

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

Cited in

(1)

• Transferable domination number of graphs

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

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