Computational aspects of double dominating sequences in graphs (Q6132543): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Dominating sequences in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Domination Game and an Imagination Strategy / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5104253 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3691778 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3691779 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Vertex sequences in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Topics in Domination in Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Structures of Domination in Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4368729 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4368728 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5503435 / rank
 
Normal rank

Latest revision as of 15:13, 2 August 2024

scientific article; zbMATH DE number 7728670
Language Label Description Also known as
English
Computational aspects of double dominating sequences in graphs
scientific article; zbMATH DE number 7728670

    Statements

    Computational aspects of double dominating sequences in graphs (English)
    0 references
    0 references
    0 references
    17 August 2023
    0 references
    double dominating sequences
    0 references
    bipartite graphs
    0 references
    chain graphs
    0 references
    NP-completeness
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers