A new lower bound on the double domination number of a graph (Q1720339): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Normalize DOI.
 
(5 intermediate revisions by 5 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.dam.2018.06.009 / 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.dam.2018.06.009 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2811376386 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3413515 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on the double domination number in trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Double Domination in Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4552196 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4368728 / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q129587753 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.DAM.2018.06.009 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 05:54, 11 December 2024

scientific article
Language Label Description Also known as
English
A new lower bound on the double domination number of a graph
scientific article

    Statements

    A new lower bound on the double domination number of a graph (English)
    0 references
    0 references
    0 references
    8 February 2019
    0 references
    domination number
    0 references
    double domination number
    0 references

    Identifiers