Graphs with equal eternal vertex cover and eternal domination numbers (Q2275369): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q5442505 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph-theoretic parameters concerning domination, independence, and irredundance / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4820838 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3158579 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized algorithm for eternal vertex cover / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4681994 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tight bounds for eternal dominating sets in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4854634 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4368728 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5441054 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3635564 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2864475 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3059008 / rank
 
Normal rank

Latest revision as of 08:40, 4 July 2024

scientific article
Language Label Description Also known as
English
Graphs with equal eternal vertex cover and eternal domination numbers
scientific article

    Statements

    Graphs with equal eternal vertex cover and eternal domination numbers (English)
    0 references
    8 August 2011
    0 references
    eternal dominating set
    0 references
    eternal vertex cover
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers