An upper bound for the total restrained domination number of graphs (Q367057): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claim: author (P16): Item:Q186280
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Khee Meng Koh / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s00373-012-1189-4 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2140660564 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Total domination in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3412131 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Total domination number of grid graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4368729 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4368728 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A survey of selected recent results on total domination in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Total restrained domination in graphs with minimum degree two / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2936660 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5397262 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On total restrained domination in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4820525 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for Vertex Partitioning Problems on Partial k-Trees / rank
 
Normal rank

Latest revision as of 21:44, 6 July 2024

scientific article
Language Label Description Also known as
English
An upper bound for the total restrained domination number of graphs
scientific article

    Statements

    An upper bound for the total restrained domination number of graphs (English)
    0 references
    0 references
    0 references
    0 references
    26 September 2013
    0 references
    total restrained domination number
    0 references
    total restrained dominating set
    0 references
    independent set
    0 references
    matching
    0 references
    probabilistic method
    0 references
    open packing
    0 references

    Identifiers