Bipartization of graphs

Mateusz Miotk , Jerzy Topp , Paweł Żyliński


A 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.
Author Mateusz Miotk (FMPI / II)
Mateusz Miotk,,
- Institute of Informatics
, Jerzy Topp (FMPI / II)
Jerzy Topp,,
- Institute of Informatics
, Paweł Żyliński (FMPI / II)
Paweł Żyliński,,
- Institute of Informatics
Journal seriesGraphs and Combinatorics, ISSN 0911-0119, (N/A 70 pkt)
Issue year2019
Publication size in sheets0.5
Keywords in Englishbipartite graph, bipartization, domination number
ASJC Classification2607 Discrete Mathematics and Combinatorics; 2614 Theoretical Computer Science
Languageen angielski
LicenseOther; published final; Uznanie Autorstwa (CC-BY); with publication
Score (nominal)70
Score sourcejournalList
ScoreMinisterial score = 70.0, 05-02-2020, ArticleFromJournal
Publication indicators WoS Citations = 1; Scopus SNIP (Source Normalised Impact per Paper): 2018 = 0.854; WoS Impact Factor: 2018 = 0.488 (2) - 2018=0.563 (5)
Citation count*1 (2020-05-14)
Share Share

Get link to the record

* presented citation count is obtained through Internet information analysis and it is close to the number calculated by the Publish or Perish system.
Are you sure?