An extremal problem on group connectivity of graphs

Citations of this article
Mendeley users who have this article in their library.


Let A be an Abelian group, n≥ 3 be an integer, and ex(n, A) be the maximum integer such that every n-vertex simple graph with at most ex(n, A) edges is not A-connected. In this paper, we study ex(n, A) for {pipe}. A{pipe} ≥ 3 and present lower and upper bounds for 3 ≤ {pipe}. A{pipe} ≤ 4 and an upper bound for {pipe}. A{pipe} ≥ 5. © 2012 Elsevier Ltd.




Luo, R., Xu, R., & Yu, G. (2012). An extremal problem on group connectivity of graphs. European Journal of Combinatorics, 33(6), 1078–1085.

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free