Bipartization of graphs
Mateusz Miotk , Jerzy Topp , Paweł Żyliński
AbstractA dominating set of a graph G is a set D⊆VG such that every vertex in VG−D is adjacent to at least one vertex in D, and the domination number γ(G) of G is the minimum cardinality of a dominating set of G. In this paper we provide a new characterization of bipartite graphs whose domination number is equal to the cardinality of its smaller partite set. Our characterization is based upon a new graph operation.
|Journal series||Graphs and Combinatorics, ISSN 0911-0119, (N/A 70 pkt)|
|Publication size in sheets||0.5|
|Keywords in English||bipartite graph, bipartization, domination number|
|License||Other; published final; ; with publication|
|Score||= 70.0, 05-02-2020, ArticleFromJournal|
|Publication indicators||= 1; : 2018 = 0.854; : 2018 = 0.488 (2) - 2018=0.563 (5)|
|Citation count*||1 (2020-02-19)|
* presented citation count is obtained through Internet information analysis and it is close to the number calculated by the Publish or Perish system.