On secure domination in graphs (Q2348710): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Import241208061232 (talk | contribs)
Normalize DOI.
 
(3 intermediate revisions by 3 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.ipl.2015.05.006 / rank
Normal rank
 
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.ipl.2015.05.006 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W248890345 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dominating sets for split and bipartite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5709011 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3413515 / 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: Q4198056 / 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: Q5503336 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5461705 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.IPL.2015.05.006 / rank
 
Normal rank

Latest revision as of 03:15, 18 December 2024

scientific article
Language Label Description Also known as
English
On secure domination in graphs
scientific article

    Statements

    On secure domination in graphs (English)
    0 references
    15 June 2015
    0 references
    combinatorial problems
    0 references
    computational complexity
    0 references
    secure domination
    0 references
    independence
    0 references
    domination
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers