Nordhaus-Gaddum results for the convex domination number of a graph (Q2454593): Difference between revisions

From MaRDI portal
Created claim: Wikidata QID (P12): Q57974348, #quickstatements; #temporary_batch_1714830594367
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Total domination in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graphs with convex domination number close to their order / rank
 
Normal rank
Property / cites work
 
Property / cites work: Restrained domination in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4552196 / 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: A sharp upper bound for the spectral radius of the Nordhaus-Gaddum type / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5632603 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5315867 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nordhaus-Gaddum results for weakly convex domination number of a graph / 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 weakly convex and convex domination numbers of a torus / rank
 
Normal rank

Revision as of 14:45, 8 July 2024

scientific article
Language Label Description Also known as
English
Nordhaus-Gaddum results for the convex domination number of a graph
scientific article

    Statements

    Identifiers