On the number of edges of a simple Z 2 × Z 2 -connected graph
Open Mathematics · 23.01.2026 · 24 (1)
DOI: 10.1515/math-2025-0271 ↗Kurz gefasst
Fachartikel in der Zeitschrift Open Mathematics, online erschienen am 05.08.2026. Verfasst von Yue Zhang und 1 weiteren Autor:innen. Die Arbeit nennt 9 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0).
Abstract (Originalsprache)
Luo, Xu and Yu proposed an extremal problem on group connectivity of graphs as follows: for an abelian group A with | A | ≥ 3 and an integer n ≥ 3, find ex ( n , A ), where ex ( n , A ) is the maximum number such that every simple graph with n vertices and at most ex ( n , A ) edges is not A -connected. In this paper, we determine the values ex ( n , Z 2 × Z 2 ) for 3 ≤ n ≤ 10.
Zitieren
APA
Zhang, Y., & Yin, J. (2026). On the number of edges of a simple Z 2 × Z 2 -connected graph. Open Mathematics, 24(1). https://doi.org/10.1515/math-2025-0271
Vancouver
Zhang Y, Yin J. On the number of edges of a simple Z 2 × Z 2 -connected graph. Open Mathematics. 2026;24(1). doi:10.1515/math-2025-0271
BibTeX
@article{Zhang2026,
author = {Zhang, Yue and Yin, Jian-Hua},
title = {On the number of edges of a simple Z 2 × Z 2 -connected graph},
journal = {Open Mathematics},
year = {2026},
volume = {24},
number = {1},
doi = {10.1515/math-2025-0271}
}
EUVIMED