The least point covering and domination numbers of a graph (Q1174131): 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: A note on total domination / rank
 
Normal rank
Property / cites work
 
Property / cites work: Total domination in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Towards a theory of domination in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel concepts in graph theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3340900 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3933018 / 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: Q3895508 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 09:50, 15 May 2024

scientific article
Language Label Description Also known as
English
The least point covering and domination numbers of a graph
scientific article

    Statements

    The least point covering and domination numbers of a graph (English)
    0 references
    0 references
    25 June 1992
    0 references
    0 references
    total point cover
    0 references
    least point covering number
    0 references
    least domination number
    0 references