Double vertex-edge domination (Q5370818): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claims
Set OpenAlex properties.
 
(3 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Balakrishna Krishnakumari / rank
 
Normal rank
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: Vertex-edge domination in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounds on weak Roman and 2-rainbow domination numbers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3691778 / 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: Total Domination in Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounds on the vertex-edge domination number of a tree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3059032 / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1142/s1793830917500458 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2663774503 / rank
 
Normal rank

Latest revision as of 10:27, 30 July 2024

scientific article; zbMATH DE number 6794600
Language Label Description Also known as
English
Double vertex-edge domination
scientific article; zbMATH DE number 6794600

    Statements

    Double vertex-edge domination (English)
    0 references
    20 October 2017
    0 references
    vertex-edge dominating set
    0 references
    double vertex-edge dominating set
    0 references
    trees
    0 references

    Identifiers