Monotonicity and expansion of global secure sets (Q1761464): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Laplacian spectrum of weakly quasi-threshold graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Security in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A simple linear time certifying LBFS-based algorithm for recognizing trivially perfect graphs and their complements / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complement reducible graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Linear Recognition Algorithm for Cographs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a graph's security number / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounds on a graph's security number / rank
 
Normal rank
Property / cites work
 
Property / cites work: A simple linear time algorithm for cograph recognition / rank
 
Normal rank
Property / cites work
 
Property / cites work: The possible cardinalities of global secure sets in cographs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Security number of grid-like graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On simple characterizations of k-trees / rank
 
Normal rank

Latest revision as of 20:53, 5 July 2024

scientific article
Language Label Description Also known as
English
Monotonicity and expansion of global secure sets
scientific article

    Statements

    Monotonicity and expansion of global secure sets (English)
    0 references
    15 November 2012
    0 references
    global secure set
    0 references
    fixed cardinality
    0 references
    dominating set
    0 references
    weakly quasi-threshold graph
    0 references
    co-quasi-threshold graph
    0 references
    \(k\)-trees
    0 references

    Identifiers