Mutual transferability for \((F, B, R)\)-domination on strongly chordal graphs and cactus graphs (Q1735675): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Characterizations of totally balanced matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dominating Sets in Chordal Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4247463 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The <i>k</i>-Domination and <i>k</i>-Stability Problems on Sun-Free Chordal Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A linear-time algorithm for paired-domination problem in strongly chordal graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A linear algorithm for the domination number of a tree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dominating sets in perfect graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Characterizations of strongly chordal graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Domination, independent domination, and duality in strongly chordal graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A tight bound on the number of mobile servers to guarantee transferability among dominating configurations / rank
 
Normal rank
Property / cites work
 
Property / cites work: On recognition of threshold tolerance graphs and their complements / rank
 
Normal rank
Property / cites work
 
Property / cites work: A linear algorithm for finding a minimum dominating set in a cactus / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving covering problems and the uncapacitated plant location problem on trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Algorithmic Complexity of Total Domination / rank
 
Normal rank
Property / cites work
 
Property / cites work: Doubly Lexical Orderings of Matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Characterizing and computing the structure of clique intersections in strongly chordal graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Three Partition Refinement Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: From a simple elimination ordering to a strong elimination ordering in linear time / rank
 
Normal rank

Revision as of 23:27, 18 July 2024

scientific article
Language Label Description Also known as
English
Mutual transferability for \((F, B, R)\)-domination on strongly chordal graphs and cactus graphs
scientific article

    Statements

    Mutual transferability for \((F, B, R)\)-domination on strongly chordal graphs and cactus graphs (English)
    0 references
    0 references
    0 references
    0 references
    28 March 2019
    0 references
    domination
    0 references
    stability
    0 references
    transferability
    0 references
    strongly chordal graphs
    0 references
    cactus graphs
    0 references

    Identifiers