On secure domination in trees (Q5236045): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: A linear algorithm for secure domination in trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: On minimum secure dominating sets of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5298923 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Vertex Covers and Secure Domination in Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Irredundance, secure domination and maximum degree in trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4812925 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5461685 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Secure domination critical graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Secure domination and secure total domination in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On secure domination in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5461705 / rank
 
Normal rank

Latest revision as of 16:44, 20 July 2024

scientific article; zbMATH DE number 7117161
Language Label Description Also known as
English
On secure domination in trees
scientific article; zbMATH DE number 7117161

    Statements

    On secure domination in trees (English)
    0 references
    0 references
    0 references
    0 references
    15 October 2019
    0 references
    tree
    0 references
    secure dominating set
    0 references
    secure domination number
    0 references

    Identifiers