Bounding the total domination subdivision number of a graph in terms of its order (Q630192): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Effect of edge-subdivision on vertex-domination in a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5442384 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Disproof of a conjecture on the subdivision domination number of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3620552 / 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: Domination Subdivision Numbers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4405924 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Total domination subdivision numbers of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Total domination subdivision numbers of trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3514292 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An upper bound for the total domination subdivision number of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3095938 / rank
 
Normal rank

Latest revision as of 21:54, 3 July 2024

scientific article
Language Label Description Also known as
English
Bounding the total domination subdivision number of a graph in terms of its order
scientific article

    Statements