Inequality of Nordhaus-Gaddum type for total outer-connected domination in graphs (Q2430322): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claim: author (P16): Item:Q1598802
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Li-ying Kang / 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.1007/s10114-011-9057-3 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2029251279 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Complementary Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Total outer-connected domination numbers of trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Restrained domination in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5461690 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Paired-domination number of a graph and its complement / rank
 
Normal rank
Property / cites work
 
Property / cites work: Total domination and total domination subdivision number of a graph and its complement / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nordhaus-Gaddum results for restrained domination and total restrained domination in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5632603 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5318984 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Domination number in graphs with minimum degree two / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4368728 / rank
 
Normal rank

Latest revision as of 22:24, 3 July 2024

scientific article
Language Label Description Also known as
English
Inequality of Nordhaus-Gaddum type for total outer-connected domination in graphs
scientific article

    Statements

    Inequality of Nordhaus-Gaddum type for total outer-connected domination in graphs (English)
    0 references
    0 references
    0 references
    6 April 2011
    0 references
    graph
    0 references
    domination number
    0 references
    total outer-connected domination
    0 references
    Nordhaus-Gaddum inequality
    0 references

    Identifiers