Bicritical domination and double coalescence of graphs-Reference-Cited by-同舟云学术

Bicritical domination and double coalescence of graphs

Published:2016-09-01 Issue:3 Volume:23 Page:399-404
ISSN:1572-9176
Container-title:Georgian Mathematical Journal
language:
Short-container-title:

Author:

Krzywkowski Marcin¹,Mojdeh Doost Ali²

Affiliation:

1. 1Department of Pure and Applied Mathematics, University of Johannesburg, South Africa; and Faculty of Electronics, Telecommunications and Informatics, Gdansk University of Technology, Poland

2. 2Department of Mathematics, University of Mazandaran, Babolsar, Iran (Islamic Republic of)

Abstract

AbstractA graph 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.

Publisher

Walter de Gruyter GmbH

Subject

General Mathematics

Link

https://www.degruyter.com/downloadpdf/journals/gmj/23/3/article-p399.xml

Reference18 articles.

1. Bicritical domination;Discrete Math.,2005

2. Characteristics of (γ,3)${(\gamma,3)}$-critical graphs;Appl. Anal. Discrete Math.,2010

3. Characteristics of (γ,3)${(\gamma,3)}$-critical graphs;Appl. Anal. Discrete Math.,2010

Cited by 2 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. The existence of a graph whose vertex set can be partitioned into a fixed number of strong domination-critical vertex-sets;AIMS Mathematics;2023

2. Domination Critical Knödel Graphs;Iranian Journal of Science and Technology, Transactions A: Science;2019-04-25