Secure domination in rooted product graphs (Q2025078): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Secure domination in cographs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the secure domination numbers of maximal outerplanar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On secure domination in graphs / 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: Q4368728 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The secure domination problem in cographs / 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 trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: On computing a minimum secure dominating set in block graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Protection of graphs with emphasis on Cartesian product graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A simple algorithm for secure domination in proper interval graphs / rank
 
Normal rank

Latest revision as of 18:03, 25 July 2024

scientific article
Language Label Description Also known as
English
Secure domination in rooted product graphs
scientific article

    Statements

    Identifiers