Fractional dominations and fractional total dominations of graph complements (Q1613430): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Import240304020342 (talk | contribs)
Set profile property.
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank

Revision as of 05:03, 5 March 2024

scientific article
Language Label Description Also known as
English
Fractional dominations and fractional total dominations of graph complements
scientific article

    Statements

    Fractional dominations and fractional total dominations of graph complements (English)
    0 references
    0 references
    29 August 2002
    0 references
    Let \(\gamma_f(G)\) and \(\Gamma_f(G)\) be the fractional domination number and the fractional total domination number of a graph \(G\). If \(\overline G\) is the complement of \(G\), then the main result says that \({\gamma_f(G)}^{-1}+ {\Gamma_f(\overline G)}^{-1}=1.\) As an application of this identity, the author presents results for these parameters on the join of graphs, Mycielski's construction, and some graph products.
    0 references
    0 references
    0 references
    fractional total domination
    0 references
    graph complement
    0 references