Loading...
An extremal problem on group connectivity of graphs
Luo, Rong Luo, Rong Xu, Rui Yu, Gexin
Luo, Rong
Luo, Rong
Xu, Rui
Yu, Gexin
Abstract
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 IAI > 3 and present lower and upper bounds for 3 < IAI 5. 0 2012 Elsevier Ltd. All rights reserved.
Description
Date
2012-01-01
Journal Title
Journal ISSN
Volume Title
Publisher
Collections
Download Dataset
Rights Holder
Usage License
Embargo
Research Projects
Organizational Units
Journal Issue
Keywords
Citation
Advisor
Department
Mathematics
DOI
10.1016/j.ejc.2012.01.003