Bicritical domination and double coalescence of graphs

被引：3

作者：

Krzywkowski, Marcin ^{[1
,2
]}

Mojdeh, Doost Ali ^{[3
]}

机构：

[1] Univ Johannesburg, Dept Pure & Appl Math, Johannesburg, South Africa

[2] Gdansk Univ Technol, Fac Elect Telecommun & Informat, Gdansk, Poland

[3] Univ Mazandaran, Dept Math, Babol Sar, Iran

来源：

GEORGIAN MATHEMATICAL JOURNAL | 2016年 / 23卷 / 03期

关键词：

Domination; bicritical domination; edge connectivity; coalescence; double coalescence;

D O I：

10.1515/gmj-2016-0019

中图分类号：

O1 [数学];

学科分类号：

0701 ; 070101 ;

摘要：

A 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.

引用

页码：399 / 404

页数：6

共 9 条

[1] [Anonymous], PURE APPL MATH
[2] Bicritical domination
Brigham, RC
Haynes, TW
Henning, MA
Rall, DF
[J]. DISCRETE MATHEMATICS, 2005, 305 (1-3) : 18 - 32
[3] THE DIAMETER OF DOMINATION K-CRITICAL GRAPHS
FAVARON, O
SUMNER, DP
WOJCICKA, E
[J]. JOURNAL OF GRAPH THEORY, 1994, 18 (07) : 723 - 734
[4] Coalescence and criticality of graphs
Grobler, P. J. P.
Roux, A.
[J]. DISCRETE MATHEMATICS, 2013, 313 (10) : 1087 - 1097
[5] CHARACTERISTICS OF (γ, 3)-CRITICAL GRAPHS
Mojdeh, D. A.
Firoozi, P.
[J]. APPLICABLE ANALYSIS AND DISCRETE MATHEMATICS, 2010, 4 (01) : 197 - 206
[6] Phillips JB, 2000, UTILITAS MATHEMATICA, V58, P129
[7] Sumner DP, 1998, MG TXB PUR APPL MATH, V209, P439
[8] CRITICAL CONCEPTS IN DOMINATION
SUMNER, DP
[J]. DISCRETE MATHEMATICS, 1990, 86 (1-3) : 33 - 46
[9] West D. B., 2005, Introduction to Graph Theory

← 1 →