Fractional domination of strong direct products (Q1324692): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claims
RedirectionBot (talk | contribs)
Changed an Item
Property / author
 
Property / author: Jennifer K. Ryan / rank
 
Normal rank
Property / reviewed by
 
Property / reviewed by: Peter Horák / rank
 
Normal rank

Revision as of 02:10, 11 February 2024

scientific article
Language Label Description Also known as
English
Fractional domination of strong direct products
scientific article

    Statements

    Fractional domination of strong direct products (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    5 September 1994
    0 references
    The domination number of a graph \(G\), \(\gamma(G)\), is the minimum size of a set \(A\) of vertices of \(G\) such that each vertex of \(G\) is either in \(A\) or is adjacent to an element of \(A\). Vizing conjectured that \(\gamma (G \oplus H) = \gamma (G) \cdot \gamma (H)\), where \(G \oplus H\) is the Cartesian product of \(G\) and \(H\). In the paper an analogous result for fractional domination numbers is proved.
    0 references
    Vizing conjecture
    0 references
    domination number
    0 references
    Cartesian product
    0 references
    fractional domination numbers
    0 references
    0 references

    Identifiers