The product of the restrained domination numbers of a graph and its complement (Q2452393): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: On equality in an upper bound for the restrained and total domination numbers of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Restrained domination in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Restrained domination in trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2708253 / 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: An upper bound for the restrained domination number of a graph with minimum degree at least two in terms of order and minimum degree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4368728 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5632603 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Connected domination number of a graph and its complement / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Complementary Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for Vertex Partitioning Problems on Partial k-Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Remarks on restrained domination and total restrained domination in graphs / rank
 
Normal rank

Revision as of 13:17, 8 July 2024

scientific article
Language Label Description Also known as
English
The product of the restrained domination numbers of a graph and its complement
scientific article

    Statements

    Identifiers