{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,25]],"date-time":"2026-03-25T05:10:03Z","timestamp":1774415403344,"version":"3.50.1"},"reference-count":10,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[2003,8,1]],"date-time":"2003-08-01T00:00:00Z","timestamp":1059696000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":3638,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Mathematics"],"published-print":{"date-parts":[[2003,8]]},"DOI":"10.1016\/s0012-365x(03)00133-x","type":"journal-article","created":{"date-parts":[[2003,5,19]],"date-time":"2003-05-19T12:52:26Z","timestamp":1053348746000},"page":"311-317","source":"Crossref","is-referenced-by-count":2,"title":["Number of minimum vertex cuts in transitive graphs"],"prefix":"10.1016","volume":"270","author":[{"given":"Jixiang","family":"Meng","sequence":"first","affiliation":[]},{"given":"Zhao","family":"Zhang","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0012-365X(03)00133-X_BIB1","doi-asserted-by":"crossref","first-page":"339","DOI":"10.1002\/jgt.3190100311","article-title":"On unreliability polynomials and graph connectivity in reliable network synthesis","volume":"10","author":"Boesch","year":"1986","journal-title":"J. Graph Theory"},{"key":"10.1016\/S0012-365X(03)00133-X_BIB2","doi-asserted-by":"crossref","first-page":"176","DOI":"10.1137\/0120023","article-title":"On the invulnerability of the regular complete k-partite graphs","volume":"20","author":"Boesch","year":"1971","journal-title":"SIAM J. Appl. Math."},{"key":"10.1016\/S0012-365X(03)00133-X_BIB3","first-page":"173","article-title":"On graphs of invulnerable communication net","volume":"CT-17","author":"Boesch","year":"1970","journal-title":"IEEE Trans. Circuit Theory"},{"key":"10.1016\/S0012-365X(03)00133-X_BIB4","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":"10.1016\/S0012-365X(03)00133-X_BIB5","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1002\/net.3230190106","article-title":"Extremal connectivity and vulnerability in graphs","volume":"19","author":"Doty","year":"1989","journal-title":"Networks"},{"key":"10.1016\/S0012-365X(03)00133-X_BIB6","doi-asserted-by":"crossref","first-page":"241","DOI":"10.1002\/net.3230030304","article-title":"On the design of reliable networks","volume":"3","author":"Hakimi","year":"1973","journal-title":"Networks"},{"key":"10.1016\/S0012-365X(03)00133-X_BIB7","doi-asserted-by":"crossref","first-page":"309","DOI":"10.1016\/S0195-6698(84)80034-7","article-title":"On the connectivity of Cayley digraphs","volume":"5","author":"Hamidoune","year":"1984","journal-title":"European J. Combin."},{"key":"10.1016\/S0012-365X(03)00133-X_BIB8","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1007\/BF01788139","article-title":"Vosperian and super-connected Abelian Cayley digraphs","volume":"7","author":"Hamidoune","year":"1991","journal-title":"Graphs Combin."},{"key":"10.1016\/S0012-365X(03)00133-X_BIB9","doi-asserted-by":"crossref","first-page":"723","DOI":"10.1002\/net.3230200603","article-title":"On the construction of optimally reliable graphs","volume":"20","author":"Smith","year":"1990","journal-title":"Networks"},{"key":"10.1016\/S0012-365X(03)00133-X_BIB10","doi-asserted-by":"crossref","unstructured":"R. Tindell, Connectivity of Cayley graphs, in: D.Z. Du, D.F. Hsu (Eds.), Combinatorial Network Theory, 1996, pp. 41\u201364.","DOI":"10.1007\/978-1-4757-2491-2_2"}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0012365X0300133X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0012365X0300133X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,21]],"date-time":"2019-03-21T07:25:19Z","timestamp":1553153119000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0012365X0300133X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,8]]},"references-count":10,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[2003,8]]}},"alternative-id":["S0012365X0300133X"],"URL":"https:\/\/doi.org\/10.1016\/s0012-365x(03)00133-x","relation":{},"ISSN":["0012-365X"],"issn-type":[{"value":"0012-365X","type":"print"}],"subject":[],"published":{"date-parts":[[2003,8]]}}}