Improved upper bounds on the domination number of graphs with minimum degree at least five (Q292247): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Importer (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 5 users not shown)
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 05C69 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 05C35 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 05C85 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6592575 / rank
 
Normal rank
Property / zbMATH Keywords
 
domination number
Property / zbMATH Keywords: domination number / rank
 
Normal rank
Property / zbMATH Keywords
 
minimum degree
Property / zbMATH Keywords: minimum degree / rank
 
Normal rank
Property / zbMATH Keywords
 
greedy algorithm
Property / zbMATH Keywords: greedy algorithm / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1899855728 / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q59072382 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1410.4334 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 13:18, 18 April 2024

scientific article
Language Label Description Also known as
English
Improved upper bounds on the domination number of graphs with minimum degree at least five
scientific article

    Statements

    Improved upper bounds on the domination number of graphs with minimum degree at least five (English)
    0 references
    0 references
    0 references
    13 June 2016
    0 references
    0 references
    0 references
    0 references
    0 references
    domination number
    0 references
    minimum degree
    0 references
    greedy algorithm
    0 references
    0 references
    0 references
    0 references