A characterization of trees having a minimum vertex cover which is also a minimum total dominating set (Q5377033): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claim: author (P16): Item:Q1805637
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 3 users not shown)
label / enlabel / en
 
A characterization of trees having a minimum vertex cover which is also a minimum total dominating set
Property / author
 
Property / author: Rita E. Zuazua / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / arXiv classification
 
math.CO
Property / arXiv classification: math.CO / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1705.00216 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A characterization of trees with equal 2-domination and 2-independence numbers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Total domination in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Construction of trees and graphs with equal domination parameters / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fixed-parameter tractability and completeness II: On completeness for W[1] / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2839639 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Edge dominating sets and vertex covers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4854634 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Characterizations of trees with equal domination parameters / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4368728 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A characterization of Roman trees / 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 Domination in Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A characterization of trees with equal independent domination and secure domination numbers / rank
 
Normal rank
Property / cites work
 
Property / cites work: A constructive characterization of trees with at least k disjoint maximum matchings / rank
 
Normal rank

Latest revision as of 08:37, 19 July 2024

scientific article; zbMATH DE number 7057493
Language Label Description Also known as
English
A characterization of trees having a minimum vertex cover which is also a minimum total dominating set
scientific article; zbMATH DE number 7057493

    Statements

    0 references
    0 references
    0 references
    23 May 2019
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    vertex cover number
    0 references
    minimum vertex cover problem
    0 references
    math.CO
    0 references
    0 references