Critical concepts in domination (Q2277481): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Domination critical graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On domination and independent domination numbers of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Domination alteration sets in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Domination critical graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tough graphs and Hamiltonian circuits. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4163262 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Relations between packing and covering numbers of a tree / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the existence of 1-factors in partial squares of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two Bounds for the Domination Number of a Graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: 1-Factors and Antifactor Sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5509541 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 15:15, 21 June 2024

scientific article
Language Label Description Also known as
English
Critical concepts in domination
scientific article

    Statements

    Critical concepts in domination (English)
    0 references
    0 references
    1990
    0 references
    [For the entire collection see Zbl 0716.00005.] The paper studies domination critical and domination perfect graphs. A graph is domination critical, if its domination number is k and decreases after adding any new edge. A graph is domination perfect, if the domination number of any of its subgraphs is equal to its independent domination number, i.e. the minimum number of vertices of a set which is simultaneously independent and dominating in G. Various properties of 3- critical graphs are described; degree sequences and diameters of such graphs are investigated. At the end some theorems on domination perfect graphs are proved, among them a theorem characterizing planar domination perfect graphs by means of forbidden induced subgraphs.
    0 references
    domination k-critical graph
    0 references
    domination perfect graphs
    0 references
    domination number
    0 references
    degree sequences
    0 references

    Identifiers