{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,31]],"date-time":"2026-03-31T06:42:50Z","timestamp":1774939370705,"version":"3.50.1"},"reference-count":33,"publisher":"MDPI AG","issue":"2","license":[{"start":{"date-parts":[[2022,2,2]],"date-time":"2022-02-02T00:00:00Z","timestamp":1643760000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"name":"Natural Science Foundation of Fujian Province, China","award":["2021J01860"],"award-info":[{"award-number":["2021J01860"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Symmetry"],"abstract":"<jats:p>The reliability measure of networks is of significant importance to the design and maintenance of networks. Based on connectivity, many refined quantitative indicators for the reliability of network systems have been introduced. The super vertex edge-connectivity and cyclic edge-connectivity, as important parameters to evaluate the robustness of networks, are explored extensively. As a variant of the hypercube Qn, the varietal hypercube VQn has better properties than Qn with the same number of edges and vertices. Wang and Xu have proved that VQn is super vertex-connected for n\u22651 and is also super edge-connected if n\u22602. In this paper, we use another method to prove these results. Moreover, we also obtain the super restricted connectivity and the cyclic edge-connectivity of the varietal hypercube VQn.<\/jats:p>","DOI":"10.3390\/sym14020304","type":"journal-article","created":{"date-parts":[[2022,2,6]],"date-time":"2022-02-06T20:40:18Z","timestamp":1644180018000},"page":"304","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":9,"title":["Super Vertex (Edge)-Connectivity of Varietal Hypercube"],"prefix":"10.3390","volume":"14","author":[{"given":"Zhecheng","family":"Yu","sequence":"first","affiliation":[{"name":"School of Science, Jimei University, Xiamen 361021, China"},{"name":"Digital Fujian Big Data Modeling and Intelligent Computing Institute, Xiamen 361021, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2060-9289","authenticated-orcid":false,"given":"Liqiong","family":"Xu","sequence":"additional","affiliation":[{"name":"School of Science, Jimei University, Xiamen 361021, China"},{"name":"Digital Fujian Big Data Modeling and Intelligent Computing Institute, Xiamen 361021, China"}]},{"given":"Shanshan","family":"Yin","sequence":"additional","affiliation":[{"name":"School of Science, Jimei University, Xiamen 361021, China"},{"name":"Digital Fujian Big Data Modeling and Intelligent Computing Institute, Xiamen 361021, China"}]},{"given":"Litao","family":"Guo","sequence":"additional","affiliation":[{"name":"Department of Mathematics, Xiamen University of Technology, Xiamen 361024, China"}]}],"member":"1968","published-online":{"date-parts":[[2022,2,2]]},"reference":[{"key":"ref_1","doi-asserted-by":"crossref","first-page":"2478","DOI":"10.1049\/iet-com.2018.6272","article-title":"Prolonging smart grid network lifetime through optimising number of sensor nodes and packet length","volume":"13","author":"Elwekeil","year":"2019","journal-title":"IET Commun."},{"key":"ref_2","unstructured":"Xu, J.-M. (2013). Combinatorial Theory in Networks, Academic Press."},{"key":"ref_3","first-page":"126845","article-title":"Note on reliability evaluation of arrangement graphs","volume":"418","author":"Li","year":"2022","journal-title":"Appl. Math. Comput."},{"key":"ref_4","doi-asserted-by":"crossref","first-page":"347","DOI":"10.1002\/net.3230130303","article-title":"Conditional connectivity","volume":"13","author":"Harary","year":"1983","journal-title":"Networks"},{"key":"ref_5","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1016\/0020-0190(88)90025-7","article-title":"On computing a conditional edge-connectivity of a graph","volume":"27","author":"Esfahanian","year":"1988","journal-title":"Inf. Process. Lett."},{"key":"ref_6","first-page":"245","article-title":"Super-connectivity and super-edge-connectivity for some interconnection networks","volume":"140","author":"Chen","year":"2003","journal-title":"Appl. Math. Comput."},{"key":"ref_7","first-page":"25","article-title":"On super and restricted connectivity of some interconnection networks","volume":"94","author":"Xu","year":"2010","journal-title":"Ars Combin."},{"key":"ref_8","doi-asserted-by":"crossref","first-page":"876","DOI":"10.1109\/TC.2014.2304391","article-title":"Symmetric property and reliability of balanced hypercube","volume":"64","author":"Zhou","year":"2014","journal-title":"IEEE Trans. Comput."},{"key":"ref_9","doi-asserted-by":"crossref","unstructured":"Bollob\u00e1s, B. (1978). Extremal Graph Theory, Academic.","DOI":"10.1007\/978-1-4612-9967-7"},{"key":"ref_10","doi-asserted-by":"crossref","unstructured":"Plummer, M.D. (1972). On the Cyclic Connectivity of Planar Graphs, Graph Theory and Applications, Springer.","DOI":"10.1007\/BFb0067376"},{"key":"ref_11","doi-asserted-by":"crossref","first-page":"549","DOI":"10.1007\/s10878-010-9304-z","article-title":"Super cyclically edge connected transitive graphs","volume":"22","author":"Zhang","year":"2011","journal-title":"J. Comb. Optim."},{"key":"ref_12","doi-asserted-by":"crossref","first-page":"779","DOI":"10.1007\/s00373-019-02031-4","article-title":"The cyclic edge-connectivity of strongly regular graphs","volume":"35","author":"Zhang","year":"2019","journal-title":"Graphs Comb."},{"key":"ref_13","doi-asserted-by":"crossref","first-page":"4555","DOI":"10.1016\/j.disc.2009.02.019","article-title":"On cyclic edge-connectivity of transitive graphs","volume":"309","author":"Wang","year":"2009","journal-title":"Discret. Math."},{"key":"ref_14","doi-asserted-by":"crossref","first-page":"208","DOI":"10.1016\/j.jcss.2017.04.002","article-title":"On g-extra connectivity of hypercube-like networks","volume":"88","author":"Zhou","year":"2017","journal-title":"J. Comput. Syst. Sci."},{"key":"ref_15","doi-asserted-by":"crossref","first-page":"1131","DOI":"10.1007\/s00373-017-1827-y","article-title":"Automorphism group of the varietal hypercube graph","volume":"33","author":"Wang","year":"2017","journal-title":"Graphs Comb."},{"key":"ref_16","first-page":"132","article-title":"Network reliability evaluation of fault tolerant varietal hypercube network","volume":"5","author":"Barpanda","year":"2014","journal-title":"Int. J. Adv. Res. Comput. Sci."},{"key":"ref_17","unstructured":"Cheng, S.-Y., and Chuang, J.-H. (1994, January 19\u201321). Varietal hypercube\u2014A new interconnection network topology for large scale multicomputer. Proceedings of the 1994 International Conference on Parallel and Distributed Systems, Hsinchu, Taiwan."},{"key":"ref_18","first-page":"732","article-title":"Cycles and paths embedded in varietal hypercubes","volume":"44","author":"Cao","year":"2014","journal-title":"J. Univ. Sci. Technol. China"},{"key":"ref_19","first-page":"1248","article-title":"Reliability analysis of varietal hypercube networks","volume":"39","author":"Wang","year":"2009","journal-title":"J. Univ. Sci. Technol. China"},{"key":"ref_20","doi-asserted-by":"crossref","first-page":"1401","DOI":"10.1007\/s11464-014-0427-x","article-title":"Transitivity of varietal hypercube networks","volume":"9","author":"Xiao","year":"2014","journal-title":"Front. Math. China"},{"key":"ref_21","doi-asserted-by":"crossref","unstructured":"Du, D.-Z., and Hsu, D.F. (1996). Combinatorial Network Theory, Springer.","DOI":"10.1007\/978-1-4757-2491-2"},{"key":"ref_22","doi-asserted-by":"crossref","first-page":"601","DOI":"10.1016\/S0166-218X(02)00391-8","article-title":"Connectivity of vertex and edge transitive graphs","volume":"127","author":"Meng","year":"2003","journal-title":"Discret. Appl. Math."},{"key":"ref_23","doi-asserted-by":"crossref","first-page":"487","DOI":"10.1002\/jgt.3190080406","article-title":"Circulants and their connectivities","volume":"8","author":"Boesch","year":"1984","journal-title":"J. Graph Theory"},{"key":"ref_24","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1002\/(SICI)1097-0037(199903)33:2<157::AID-NET6>3.0.CO;2-D","article-title":"Super edge connectivity properties of connected edge symmetric graphs","volume":"33","author":"Li","year":"1999","journal-title":"Networks"},{"key":"ref_25","doi-asserted-by":"crossref","first-page":"2273","DOI":"10.1016\/j.disc.2010.04.024","article-title":"On super restricted edge-connectivity of edge-transitive graphs","volume":"310","author":"Tian","year":"2010","journal-title":"Discret. Math."},{"key":"ref_26","doi-asserted-by":"crossref","first-page":"1248","DOI":"10.1016\/j.dam.2011.12.004","article-title":"Super restricted edge connectivity of regular edge-transitive graphs","volume":"160","author":"Zhou","year":"2012","journal-title":"Discret. Appl. Math."},{"key":"ref_27","doi-asserted-by":"crossref","first-page":"382","DOI":"10.1007\/s10878-014-9759-4","article-title":"Atoms of cyclic edge connectivity in regular graphs","volume":"31","author":"Zhou","year":"2016","journal-title":"J. Comb. Optim."},{"key":"ref_28","doi-asserted-by":"crossref","first-page":"393","DOI":"10.1007\/s10878-012-9472-0","article-title":"Super-cyclically edge-connected regular graphs","volume":"26","author":"Zhou","year":"2013","journal-title":"J. Comb. Optim."},{"key":"ref_29","doi-asserted-by":"crossref","unstructured":"Bondy, J.A., and Murty, U.S.R. (2008). Graph Theory, Springer.","DOI":"10.1007\/978-1-84628-970-5"},{"key":"ref_30","doi-asserted-by":"crossref","first-page":"2753","DOI":"10.1016\/j.dam.2013.04.009","article-title":"Bounding the size of the subgraph induced by m vertices and extra edge-connectivity of hypercubes","volume":"161","author":"Li","year":"2013","journal-title":"Discret. Appl. Math."},{"key":"ref_31","doi-asserted-by":"crossref","first-page":"257","DOI":"10.1016\/j.dam.2020.09.009","article-title":"Symmetric property and reliability of locally twisted cubes","volume":"288","author":"Chang","year":"2021","journal-title":"Discret. Appl. Math."},{"key":"ref_32","first-page":"3","article-title":"Connectivity of lexicographic product and direct product of graphs","volume":"111","author":"Xu","year":"2013","journal-title":"Ars Combin."},{"key":"ref_33","doi-asserted-by":"crossref","unstructured":"Hammack, R.H., Imrich, W., and Klav\u017ear, S. (2011). Handbook of Product Graphs, CRC Press.","DOI":"10.1201\/b10959"}],"container-title":["Symmetry"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/2073-8994\/14\/2\/304\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,10]],"date-time":"2025-10-10T22:12:53Z","timestamp":1760134373000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/2073-8994\/14\/2\/304"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,2,2]]},"references-count":33,"journal-issue":{"issue":"2","published-online":{"date-parts":[[2022,2]]}},"alternative-id":["sym14020304"],"URL":"https:\/\/doi.org\/10.3390\/sym14020304","relation":{},"ISSN":["2073-8994"],"issn-type":[{"value":"2073-8994","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,2,2]]}}}