Inequalities involving independence domination, f-domination, connected and total f-domination numbers (Q4814435): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: On domination and independent domination numbers of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph-theoretic parameters concerning domination, independence, and irredundance / rank
 
Normal rank
Property / cites work
 
Property / cites work: Total domination in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4143304 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3693537 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new domination conception / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Number of Disjoint Edges in a Graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: On $f$-domination number of a graph / rank
 
Normal rank

Latest revision as of 20:37, 6 June 2024

scientific article; zbMATH DE number 2098175
Language Label Description Also known as
English
Inequalities involving independence domination, f-domination, connected and total f-domination numbers
scientific article; zbMATH DE number 2098175

    Statements

    Inequalities involving independence domination, f-domination, connected and total f-domination numbers (English)
    0 references
    0 references
    7 September 2004
    0 references
    domination number
    0 references
    independence domination number
    0 references
    \(f\)-domina\-tion number
    0 references
    connected \(f\)-domination number
    0 references
    total \(f\)-domination number
    0 references

    Identifiers