{"entities":{"Q1348390":{"pageid":1359129,"ns":120,"title":"Item:Q1348390","lastrevid":47913583,"modified":"2026-01-03T01:55:31Z","type":"item","id":"Q1348390","labels":{"en":{"language":"en","value":"On a kind of restricted edge connectivity of graphs"}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 1742056"}},"aliases":{},"claims":{"P31":[{"mainsnak":{"snaktype":"value","property":"P31","hash":"fd5912e4dab4b881a8eb0eb27e7893fef55176ad","datavalue":{"value":{"entity-type":"item","numeric-id":56887,"id":"Q56887"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1348390$6BB912A2-472F-4EBB-B6F8-B55B3AC0907F","rank":"normal"}],"P159":[{"mainsnak":{"snaktype":"value","property":"P159","hash":"c6eeca9099e3cb8f107b40a565c5e5d1025d6c1e","datavalue":{"value":{"text":"On a kind of restricted edge connectivity of graphs","language":"en"},"type":"monolingualtext"},"datatype":"monolingualtext"},"type":"statement","id":"Q1348390$A8642CCE-BBCB-4E49-96EC-2DE6554D53D1","rank":"normal"}],"P225":[{"mainsnak":{"snaktype":"value","property":"P225","hash":"daa1cecf0f6a5a4d9b4b9e9c6e6290f3b6981cb1","datavalue":{"value":"1007.05067","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1348390$C421FE1F-02C2-4E54-99C4-5A8A9271AA5E","rank":"normal"}],"P27":[{"mainsnak":{"snaktype":"value","property":"P27","hash":"5c711fe80abce1c6b455381a685d469741806887","datavalue":{"value":"10.1016/S0166-218X(00)00337-1","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1348390$CE4C5063-AF69-41FE-861B-12692C216F0D","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"bb4ff39cfb76eb3a16e7257e0f5515744e99ad15","datavalue":{"value":{"entity-type":"item","numeric-id":1348389,"id":"Q1348389"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1348390$0BB05B29-2066-4E20-B5DC-0630DBC7B964","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"0b95128871e4aaa44e960c86b3d6032781404f0a","datavalue":{"value":{"entity-type":"item","numeric-id":1566001,"id":"Q1566001"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1348390$E5F87099-A262-4980-86A5-998199E6DA06","rank":"normal"}],"P200":[{"mainsnak":{"snaktype":"value","property":"P200","hash":"087f55844cc920aae060b09644168bf17b022e1a","datavalue":{"value":{"entity-type":"item","numeric-id":96294,"id":"Q96294"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1348390$25B85388-EF5D-43A4-99F4-2B0D01CC1B8B","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"227e5427b5a3bbb67302bf9b39de3184f35d2317","datavalue":{"value":{"time":"+2002-05-15T00:00:00Z","timezone":0,"before":0,"after":0,"precision":11,"calendarmodel":"http://www.wikidata.org/entity/Q1985727"},"type":"time"},"datatype":"time"},"type":"statement","id":"Q1348390$3DCA828D-75C3-42BA-8950-A9ED9CAF7B7F","rank":"normal"}],"P1448":[{"mainsnak":{"snaktype":"value","property":"P1448","hash":"14424f2dcfc7536df3b0b7bcc3208ed2a52b43f2","datavalue":{"value":"Let \\(G=(V,E)\\) be a connected graph. A subset \\(S\\) of \\(E\\) is called an edge cut, if \\(G-S\\) is disconnected. If all components of \\(G-S\\) contain at least \\(m\\) vertices, it is called an \\(m\\)-restricted edge cut. The minimum size of an \\(m\\)-restricted edge cut is called the \\(m\\)-restricted edge connectivity \\(\\lambda^{(m)}\\). For a subset \\(X\\) of \\(V\\), the number of edges between \\(X\\) and \\(V\\setminus X\\) is denoted by \\(\\omega(X)\\). The quantity \\(\\xi_m\\) is defined to be \\(\\min\\{\\omega(X): X\\subseteq V\\), \\(|X|=m\\) and \\(G[X]\\) is connected\\}. Note that \\(\\xi_1\\) equals the minimum degree of a vertex and \\(\\xi_2\\) is the minimum edge degree. If \\(G\\) has at least \\(4\\) vertices and is not a star, \\(\\lambda^{(2)}\\) is finite and satisfies \\(\\lambda^{(1)}\\leq \\lambda^{(2)}\\leq \\xi_2\\); see \\textit{F. T. Boesch} and \\textit{J. F. Wang} [SIAM J. Algebraic Discrete Math. 7, 89-98 (1986; Zbl 0578.05046)]. If \\(\\lambda^{(3)}\\) is finite, the relation \\(\\lambda^{(2)}\\leq \\lambda^{(3)}\\leq \\xi_3\\) holds. The authors define a connected graph to be {super-\\(\\lambda^{(3)}\\)}, if \\(\\lambda^{(m)}=\\xi_m\\) for \\(1\\leq m\\leq 3\\). This is a specialization of the notions {super-\\(\\lambda\\)} (which implies \\(\\lambda^{(1)}=\\xi_1\\)) defined by \\textit{D. Bauer} et al. [The theory and application of graphs, 45-54 (1981; Zbl 0469.05044)] and optimal super-\\(\\lambda\\) (super-\\(\\lambda\\) with \\(\\lambda^{(2)}=\\xi_2\\)), defined by \\textit{Q. Li} and \\textit{Q. Li} [Networks 31, 61-65 (1998; Zbl 0929.05052)]. The main results of the present paper are the following: If \\(G\\) is regular with at least \\(6\\) vertices, then \\(\\lambda^{(3)}\\) is finite. If \\(G\\) is edge transitive and vertex transitive, i.e., the automorphism group acts transitively on the edges and on the vertices, and is not a cycle, it is super-\\(\\lambda^{(3)}\\). Thus star graphs and hypercubes are super-\\(\\lambda^{(3)}\\). Furthermore, an explicit formula for the number of \\(i\\)-element edge cuts for \\(k\\)-regular super-\\(\\lambda^{(3)}\\) graphs and \\(2k-2\\leq i\\leq \\xi_3-1\\) is given. Finally, a characterization of the super-\\(\\lambda^{(3)}\\) property for circulant graphs \\(C_n(a_1,\\dots,a_k)\\), i.e., the graphs with vertices \\(1,\\dots, n\\) where \\(i\\) and \\(j\\) are adjacent if and only if \\(i-j\\equiv \\pm a_s \\pmod n\\) for some \\(s\\), is given. As a consequence, the Harary graphs \\(C_n(1,2,\\dots,k)\\) with \\(2\\leq k