Game connectivity of graphs

被引：2
作者：
Matsumoto, Naoki [1 ]
Nakamigawa, Tomoki [2 ]
机构：
[1] Keio Univ, Res Inst Digital Media & Content, Yokohama, Kanagawa, Japan
[2] Shonan Inst Technol, Fujisawa, Kanagawa, Japan
来源：
DISCRETE MATHEMATICS | 2020年 / 343卷 / 11期
关键词：
Game connectivity; Connectivity; Edge-minimal graph;
D O I：
10.1016/j.disc.2020.112104
中图分类号：
O1 [数学];
学科分类号：
0701 ; 070101 ;
摘要：
In this paper, we introduce a new game invariant of graphs, called game connectivity, which is related to the connectivity of graphs. We investigate many fundamental and significant topics of the game connectivity of graphs, and propose many open problems and conjectures. (C) 2020 Elsevier B.V. All rights reserved.
引用
收藏
页数：12
相关论文
共 16 条
[1]  
Bodlaender H. L., 1991, International Journal of Foundations of Computer Science, V2, P133, DOI 10.1142/S0129054191000091
[2]   DOMINATION GAME AND AN IMAGINATION STRATEGY [J].
Bresar, Bostjan ;
Klavzar, Sandi ;
Rall, Douglas F. .
SIAM JOURNAL ON DISCRETE MATHEMATICS, 2010, 24 (03) :979-991
[3]  
Diestel R., 2017, Graduate Texts in Mathematics, V5th ed, DOI [10.1007/978-3-662-53622-3, DOI 10.1007/978-3-662-53622-3]
[4]  
Esfahanian A-H., 2013, Topics in structural graph theory, P268
[5]  
Even S., 1975, SIAM Journal on Computing, V4, P507, DOI 10.1137/0204043
[6]  
Even S., 1975, SIAM Journal on Computing, V4, P393, DOI 10.1137/0204034
[7]  
Fabrega J, 2004, HDB GRAPH THEORY, P300
[8]  
Gravier S, 2017, DISCRETE MATH THEOR, V19
[9]   Maximally edge-connected and vertex-connected graphs and digraphs: A survey [J].
Hellwig, Angelika ;
Volkmann, Lutz .
DISCRETE MATHEMATICS, 2008, 308 (15) :3265-3296
[10]   FINDING ALL MINIMUM-SIZE SEPARATING VERTEX SETS IN A GRAPH [J].
KANEVSKY, A .
NETWORKS, 1993, 23 (06) :533-541
12