Paired-domination number of a graph and its complement (Q998404): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.disc.2007.11.034 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1982249589 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5461690 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4368728 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Paired-domination in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3838207 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graphs with large paired-domination number / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3423983 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5632603 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 01:07, 29 June 2024

scientific article
Language Label Description Also known as
English
Paired-domination number of a graph and its complement
scientific article

    Statements

    Paired-domination number of a graph and its complement (English)
    0 references
    28 January 2009
    0 references
    0 references
    paired-domination number
    0 references
    Nordhaus-Gaddum inequalities
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references