Simultaneous graph parameters: factor domination and factor total domination (Q2509300): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claim: author (P16): Item:Q186199
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Wayne Goddard / rank
 
Normal rank
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.2006.04.017 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2089063440 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4004078 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4378633 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Factor domination in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5782525 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Small transversals in hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Total domination in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Factor domination and minimum degree / 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: Q3353057 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4882976 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The forest plus stars colouring problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Total domination of graphs and small transversals of hypergraphs / rank
 
Normal rank

Latest revision as of 20:54, 24 June 2024

scientific article
Language Label Description Also known as
English
Simultaneous graph parameters: factor domination and factor total domination
scientific article

    Statements

    Simultaneous graph parameters: factor domination and factor total domination (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    19 October 2006
    0 references
    Let \(F_1,F_2,\dots,F_k\) be \(k\) factors of a graph \(G\). A subset \(S\) of \(V(G)\) is a factor dominating set if in every \(F_i\) every vertex not in \(S\) is adjacent to a vertex in \(S\), and a factor total dominating set if in every \(F_i\) every vertex in \(V(G)\) is adjacent to a vertex in \(S\). The cardinality of a smallest such set is called the factor (total) domination number. The authors present some upper bounds on the factor (total) domination number. These bounds exploit results on colorings of graphs and transversals of hypergraphs.
    0 references
    0 references
    cycles
    0 references
    bounds
    0 references
    factors
    0 references
    total domination
    0 references

    Identifiers