Bicritical domination and double coalescence of graphs, By Doost Ali Mojdeh

Research

Title	Bicritical domination and double coalescence of graphs
Type	Article
Keywords	Domination, bicritical domination, edge connectivity, coalescence, double coalescence
Journal	Georgian Mathematical Journal
DOI	https://doi.org/10.1515/gmj-2016-0019
Researchers	Marcin Krzywkowski (First researcher) , Doost Ali Mojdeh (Second researcher)

Abstract

Agraph is bicritical if the removal of any pair of vertices decreases the domination number.We study the properties of bicritical graphs and their relation with critical graphs, and we obtain results for bicritical graphs with edge connectivity two or three. We also generalize the notion of the coalescence of two graphs and investigate the bicriticality of such graphs.