科研之友
微信
新浪微博
Facebook
分享链接
摘要
In Luo et al. (2012), an extremal graph theory problem is proposed for group connectivity: for an abelian group A with IAI %26gt; 3 and an integer n %26gt; 3, find ex(n, A), where ex(n, A) is the maximum number so that every n-vertex simple graph with at most ex(n, A) edges is not A-connected. In this paper, we determine the values ex(n, A) for A = Zk where k %26gt; 3 is an odd integer and for = Z4, each of which solves some open problem proposed in Luo et al. (2012). Furthermore, the values ex(n, Z4) also imply a characterization of Li-connected graphic sequences.
- 出版日期2014-8
