Answers are grounded in this paper and cite their sources.
The g-extra connectivity of a connected graph G, denoted by κg(G), is a generalization of classical connectivity which related to the integer g. In this paper, we first construct a novel network named semicrossing cube SCQn. We prove that κ4(SCQn)=5n−13. This gives an answer to a problem proposed by Zhou (J. Comput. System Sci., 88(2017) 208–219).
No takes yet. Share an insight, caveat, or question.
Qian et al. (2025) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: