An upper bound on the domination number of a graph with minimum degree 2 (Q1011694): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
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.disc.2007.12.080 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2024500249 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimum independent dominating sets of random cubic graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Independent Domination Number of Random Regular Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4368728 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4368729 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Domination in graphs with minimum degree two / rank
 
Normal rank
Property / cites work
 
Property / cites work: The dominating number of a random cubic graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Paths, Stars and the Number Three / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounds related to domination in graphs with minimum degree two / rank
 
Normal rank
Property / cites work
 
Property / cites work: Domination in graphs of minimum degree five / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 11:59, 1 July 2024

scientific article
Language Label Description Also known as
English
An upper bound on the domination number of a graph with minimum degree 2
scientific article

    Statements

    An upper bound on the domination number of a graph with minimum degree 2 (English)
    0 references
    0 references
    0 references
    0 references
    9 April 2009
    0 references
    bounds
    0 references
    path-component
    0 references
    domination number
    0 references
    dominating set
    0 references
    vertex domination
    0 references

    Identifiers