Signed domination numbers of a graph and its complement (Q1827775): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: \(k\)-subdomination in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nordhaus-Gaddum results for CO-irredundance in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4374706 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4871151 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Signed domination in regular graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Signed domination in regular graphs and set-systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5708624 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nordhaus-Gaddum inequalities for domination in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4368728 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Complementary Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on the lower bounds of signed domination number of a graph / rank
 
Normal rank

Latest revision as of 19:26, 6 June 2024

scientific article
Language Label Description Also known as
English
Signed domination numbers of a graph and its complement
scientific article

    Statements

    Signed domination numbers of a graph and its complement (English)
    0 references
    0 references
    0 references
    6 August 2004
    0 references
    0 references
    Signed domination
    0 references
    Nordhaus-Gaddum
    0 references
    Graph complements
    0 references
    0 references