Inequalities relating domination parameters in cubic graphs (Q1815314): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: What is the difference between the domination and independent domination numbers of a cubic graph? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Contributions to the theory of domination, independence and irredundance in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Properties of Hereditary Hypergraphs and Middle Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3987051 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minus domination in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4871151 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4374702 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Chordal graphs and upper irredundance, upper domination and independence / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4873765 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3972021 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some remarks on domination in cubic graphs / rank
 
Normal rank

Latest revision as of 15:37, 24 May 2024

scientific article
Language Label Description Also known as
English
Inequalities relating domination parameters in cubic graphs
scientific article

    Statements

    Inequalities relating domination parameters in cubic graphs (English)
    0 references
    0 references
    0 references
    23 March 1997
    0 references
    The paper presents various inequalities for numerical invariants of graphs \(G\) which concern domination. The following invariants are considered: domination number \(\gamma(G)\), upper domination number \(\Gamma(G)\), irredundance number \(\text{ir}(G)\), upper irredundance number \(\text{IR}(G)\), independent domination number \(i(G)\), independence number \(\beta_0(G)\), minus domination number \(\gamma^-(G)\), and signed domination number \(\gamma_s(G)\). The inequalities concern cubic graphs, i.e. regular graphs of degree 3.
    0 references
    0 references
    inequalities
    0 references
    invariants
    0 references
    domination
    0 references
    domination number
    0 references
    irredundance number
    0 references
    independence number
    0 references
    cubic graphs
    0 references
    regular graphs
    0 references