On trees with domination number equal to edge-vertex roman domination number (Q5013503): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claim: author (P16): Item:Q2244695
Set OpenAlex properties.
 
(3 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Yanamandram B. Venkatakrishnan / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Trees with unique Roman dominating functions of minimum weight / rank
 
Normal rank
Property / cites work
 
Property / cites work: Roman domination in graphs. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4368728 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4368729 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On trees with total domination number equal to edge-vertex domination number plus one / rank
 
Normal rank
Property / cites work
 
Property / cites work: An improved upper bound of edge-vertex domination number of a tree / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1142/s1793830921500452 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3112882099 / rank
 
Normal rank

Latest revision as of 10:29, 30 July 2024

scientific article; zbMATH DE number 7435916
Language Label Description Also known as
English
On trees with domination number equal to edge-vertex roman domination number
scientific article; zbMATH DE number 7435916

    Statements

    On trees with domination number equal to edge-vertex roman domination number (English)
    0 references
    30 November 2021
    0 references
    edge-vertex Roman dominating set
    0 references
    dominating set
    0 references
    trees
    0 references

    Identifiers