Vertex-edge domination in graphs
AbstractWe establish that for any connected graph G of order n≥6, a minimum vertex-edge dominating set of G has at most n/3 vertices, thus affirmatively answering the open question posed by Boutrig et al. (Aequ Math 90(2):355–366, 2016).
|Journal series||Aequationes Mathematicae, ISSN 0001-9054, (N/A 70 pkt)|
|Publication size in sheets||0.5|
|Keywords in English||vertex-edge domination, P3-packing, corona, extremal graph|
|ASJC Classification||; ;|
|Score||= 70.0, 28-01-2020, ArticleFromJournal|
|Publication indicators||= 1; : 2018 = 1.046; : 2018 = 0.874 (2) - 2018=0.865 (5)|
|Citation count*||5 (2020-05-14)|
* presented citation count is obtained through Internet information analysis and it is close to the number calculated by the Publish or Perish system.