{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T01:46:59Z","timestamp":1760147219279,"version":"build-2065373602"},"reference-count":15,"publisher":"MDPI AG","issue":"1","license":[{"start":{"date-parts":[[2023,1,16]],"date-time":"2023-01-16T00:00:00Z","timestamp":1673827200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61662066"],"award-info":[{"award-number":["61662066"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Entropy"],"abstract":"<jats:p>The graph connectivity is a fundamental concept in graph theory. In particular, it plays a vital role in applications related to the modern interconnection graphs, e.g., it can be used to measure the vulnerability of the corresponding graph, and is an important metric for reliability and fault tolerance of the graph. Here, firstly, we introduce two types of divided operations, named vertex-divided operation and edge-divided operation, respectively, as well as their inverse operations vertex-coincident operation and edge-coincident operation, to find some methods for splitting vertices of graphs. Secondly, we define a new connectivity, which can be referred to as divided connectivity, which differs from traditional connectivity, and present an equivalence relationship between traditional connectivity and our divided connectivity. Afterwards, we explore the structures of graphs based on the vertex-divided connectivity. Then, as an application of our divided operations, we show some necessary and sufficient conditions for a graph to be an Euler\u2019s graph. Finally, we propose some valuable and meaningful problems for further research.<\/jats:p>","DOI":"10.3390\/e25010176","type":"journal-article","created":{"date-parts":[[2023,1,16]],"date-time":"2023-01-16T02:29:55Z","timestamp":1673836195000},"page":"176","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["On Divided-Type Connectivity of Graphs"],"prefix":"10.3390","volume":"25","author":[{"given":"Qiao","family":"Zhou","sequence":"first","affiliation":[{"name":"College of Information and Electrical Engineering, China Agricultural University, Beijing 100083, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4232-1147","authenticated-orcid":false,"given":"Xiaomin","family":"Wang","sequence":"additional","affiliation":[{"name":"Beijing Institute of Remote Sensing Equipment, Beijing 100854, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bing","family":"Yao","sequence":"additional","affiliation":[{"name":"College of Mathematics and Statistics, Northwest Normal University, Lanzhou 730070, China"},{"name":"School of Electronics and Information Engineering, Lanzhou Jiaotong University, Lanzhou 730070, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"1968","published-online":{"date-parts":[[2023,1,16]]},"reference":[{"key":"ref_1","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1016\/0166-218X(94)00158-A","article-title":"On the Structure of Trapezoid Graphs","volume":"66","author":"Cheah","year":"1996","journal-title":"Discret. Appl. Math."},{"key":"ref_2","doi-asserted-by":"crossref","first-page":"1131","DOI":"10.1016\/j.dam.2011.03.023","article-title":"Vertex Splitting and the Recognition of Trapezoid Graphs","volume":"159","author":"Mertzios","year":"2011","journal-title":"Discret. Appl. Math."},{"key":"ref_3","doi-asserted-by":"crossref","first-page":"205","DOI":"10.1016\/S0166-218X(96)00125-4","article-title":"Vertex-splitting and Chromatic Index Critical Graphs","volume":"76","author":"Hilton","year":"1997","journal-title":"Discret. Appl. Math."},{"key":"ref_4","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1023\/A:1009739202898","article-title":"Deterministic O\u02dc(nm) Time Edge-Splitting in Undirected Graphs","volume":"1","author":"Nagamochi","year":"1997","journal-title":"J. Comb. Optim."},{"key":"ref_5","first-page":"96","article-title":"Edge-splitting and Edge-connectivity Augmentation in Planar Graphs","volume":"Volume 1412","author":"Bixby","year":"1998","journal-title":"Proceedings of the 6th International IPCO Conference"},{"key":"ref_6","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1023\/A:1024470929537","article-title":"An Edge-splitting Algorithm in Planar Graphs","volume":"7","author":"Nagamochi","year":"2003","journal-title":"J. Comb. Optim."},{"key":"ref_7","doi-asserted-by":"crossref","first-page":"1263","DOI":"10.1093\/ietfec\/e89-a.5.1263","article-title":"A Fast Edge-splitting Algorithm in Edge-Weighted Graphs","volume":"89","author":"Nagamochi","year":"2006","journal-title":"IEICE Trans. Fundam. Electron. Commun. Comput. Sci."},{"key":"ref_8","doi-asserted-by":"crossref","first-page":"691","DOI":"10.1016\/j.dam.2008.08.001","article-title":"Eulerian Detachments with Local Edge-connectivity","volume":"157","author":"Fukunaga","year":"2009","journal-title":"Discret. Appl. Math."},{"key":"ref_9","doi-asserted-by":"crossref","unstructured":"Farooq, O., Lawniczak, M., Akhshani, A., Bauch, S., and Sirko, L. (2022). The Generalized Euler Characteristics of the Graphs Split at Vertices. Entropy, 24.","DOI":"10.3390\/e24030387"},{"key":"ref_10","doi-asserted-by":"crossref","unstructured":"Farooq, O., Akhshani, A., Bialous, M., Bauch, S., Lawniczak, M., and Sirko, L. (2022). Experimental Investigation of the Generalized Euler Characteristic of the Networks Split at Edges. Mathematics, 10.","DOI":"10.3390\/math10203785"},{"key":"ref_11","unstructured":"Battaglia, P.W., Hamrick, J.B., Bapst, V., Sanchez-Gonzalez, A., Zambaldi, V., Malinowski, M., Tacchetti, A., Raposo, D., Santoro, A., and Faulkner, R. (2018). Relational Inductive Biases, Deep Learning, And Graph Networks. arXiv."},{"key":"ref_12","unstructured":"Yao, B., Sun, H., Zhang, X.H., Mu, Y.R., Sun, Y.R., Wang, H.Y., Su, J., Zhang, M.J., Yang, S.H., and Yang, C. (2018). Topological Graphic Passwords And Their Matchings Towards Cryptography. arXiv."},{"key":"ref_13","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_14","first-page":"38007","article-title":"Maximal planar scale-free Sierpinski networks with small-world effect and power-law strength-degree correlation","volume":"79","author":"Zhang","year":"2007","journal-title":"Phys. Lett."},{"key":"ref_15","unstructured":"Gallian, J.A. (2016). A Dynamic Survey of Graph Labeling. Electron. J. Comb., 17."}],"container-title":["Entropy"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/1099-4300\/25\/1\/176\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,10]],"date-time":"2025-10-10T18:07:01Z","timestamp":1760119621000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/1099-4300\/25\/1\/176"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,1,16]]},"references-count":15,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2023,1]]}},"alternative-id":["e25010176"],"URL":"https:\/\/doi.org\/10.3390\/e25010176","relation":{},"ISSN":["1099-4300"],"issn-type":[{"type":"electronic","value":"1099-4300"}],"subject":[],"published":{"date-parts":[[2023,1,16]]}}}