AI Chat Paper
Note: Please note that the following content is generated by AMiner AI. SciOpen does not take any responsibility related to this content.
{{lang === 'zh_CN' ? '文章概述' : 'Summary'}}
{{lang === 'en_US' ? '中' : 'Eng'}}
Chat more with AI
Powered by AMiner. Clicking this button will take you away from SciOpen.
Home AIMS Mathematics Article
PDF (418.2 KB)
Cite
EndNote(RIS) BibTeX
Collect
Submit Manuscript AI Chat Paper
Show Outline
Outline
Show full outline
Hide outline
Outline
Show full outline
Hide outline
Research Article | Open Access

The generalized k-connectivity of conditional recursive networks

Yinkui Li1, Yilin Song1, Zhuomo An2( )
Department of Mathematics, Qinghai Nationalities University, Xining, Qinghai 810000, China
School of Public Education, Qinghai Vocational and Technical University, Xining, Qinghai 810000, China
Show Author Information

Abstract

The generalized k-connectivity κ k ( G ) of graph G is defined as the maximum number of internally disjoint Steiner trees in G, which is a generalization of classical connectivity κ ( G ) of G just for k = 2. Conditional recursive networks (CRNs) form a new family of composite networks constructed from complete graphs. In this paper, we determine the generalized k-connectivity of CRNs for k = 4.

Keywords

the generalized connectivitythe generalized edge-connectivityconditional recursive networks
CLC number: 05C05, 05C40

References

【1】
【1】
 
 
Crossref Google Scholar
AIMS Mathematics
Volume 11 Issue 1,
January 2026
Pages 1807-1819
DOI: 10.3934/math.2026075

{{item.num}}

Comments on this article

Go to comment

< Back to all reports

Review Status: {{reviewData.commendedNum}} Commended , {{reviewData.revisionRequiredNum}} Revision Required , {{reviewData.notCommendedNum}} Not Commended Under Peer Review

Review Comment

Cite this Report
Close
Close
Cite this article:
Li Y, Song Y, An Z. The generalized k-connectivity of conditional recursive networks. AIMS Mathematics, 2026, 11(1): 1807-1819. https://doi.org/10.3934/math.2026075

117

Views

2

Downloads

0

Crossref

0

Web of Science

0

Scopus
Received: 27 September 2025
Revised: 26 December 2025
Accepted: 05 January 2026
Published: 20 January 2026
©2026 the Author(s), licensee AIMS Press.

This is an open access article distributed under the terms of the Creative Commons Attribution License (https://creativecommons.org/licenses/by/4.0)