Year: 2019
Type: article
Abstract: A dominating set of a graph G is a set $$D\subseteq V_G$$ such that every vertex in $$V_G-D$$ is adjacent to at least one vertex in D, and the domination number $$\gamma (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.
Source: Graphs and Combinatorics
Authors: Mateusz Miotk, Jerzy Topp, Paweł Żyliński
Institution: University of Gdańsk
Language: English
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: hybrid
Estimated APC paid: $2,690
Funder: Uniwersytet Gdański
OpenAlex ID: W2967283155