Relations between edge removing and edge subdivision concerning domination number of a graph (Q2420425): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q3815323 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Domination alteration sets in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5422499 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An extremal problem for edge domination insensitive graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Domination and independence subdivision numbers of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Domination Subdivision Numbers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4368728 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Changing and unchanging domination: A classification / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the domination of the products of graphs II: Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5401057 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A survey on graphs which have equal domination and closed neighbourhood packing numbers / rank
 
Normal rank
Property / cites work
 
Property / cites work: New results about the bondage number of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5564127 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Domination critical graphs / rank
 
Normal rank

Latest revision as of 11:54, 19 July 2024

scientific article
Language Label Description Also known as
English
Relations between edge removing and edge subdivision concerning domination number of a graph
scientific article

    Statements

    Relations between edge removing and edge subdivision concerning domination number of a graph (English)
    0 references
    0 references
    0 references
    0 references
    6 June 2019
    0 references
    0 references
    domination number
    0 references
    edge removing
    0 references
    edge subdividing
    0 references
    efficient graph
    0 references
    tree
    0 references
    Vizing's conjecture
    0 references
    \(\gamma_{\mathrm{sd}}\)-critical graph
    0 references
    \(\gamma\)-insensitive graph
    0 references
    0 references
    0 references