{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,22]],"date-time":"2025-12-22T04:31:46Z","timestamp":1766377906922},"reference-count":9,"publisher":"Elsevier BV","issue":"2-3","license":[{"start":{"date-parts":[[1999,7,1]],"date-time":"1999-07-01T00:00:00Z","timestamp":930787200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Applied Mathematics and Computation"],"published-print":{"date-parts":[[1999,7]]},"DOI":"10.1016\/s0096-3003(98)10041-3","type":"journal-article","created":{"date-parts":[[2003,4,4]],"date-time":"2003-04-04T22:33:30Z","timestamp":1049495610000},"page":"129-137","source":"Crossref","is-referenced-by-count":45,"title":["On connectivity of the Cartesian product of two graphs"],"prefix":"10.1016","volume":"102","author":[{"given":"Wen-Sz","family":"Chiue","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bih-Sheue","family":"Shieh","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"issue":"9","key":"10.1016\/S0096-3003(98)10041-3_BIB1","doi-asserted-by":"crossref","first-page":"1175","DOI":"10.1109\/31.7582","article-title":"Graph theoretic reliability analysis for the Boolean n-cube networks","volume":"CAS\u201335","author":"Yang","year":"1988","journal-title":"IEEE Trans. Circuits Systems"},{"key":"10.1016\/S0096-3003(98)10041-3_BIB2","doi-asserted-by":"crossref","first-page":"185","DOI":"10.1080\/00207168808803618","article-title":"The number of spanning trees of the regular networks","volume":"23","author":"Yang","year":"1988","journal-title":"Inter. J. Comput. Math."},{"key":"10.1016\/S0096-3003(98)10041-3_BIB3","doi-asserted-by":"crossref","first-page":"351","DOI":"10.1016\/0012-365X(74)90154-X","article-title":"Results on the edge-connectivity of graphs","volume":"8","author":"Lesniak","year":"1974","journal-title":"Discrete Math."},{"issue":"1","key":"10.1016\/S0096-3003(98)10041-3_BIB4","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1002\/jgt.3190130103","article-title":"Edge-connectivity in p-partite graphs","volume":"13","author":"Volkmann","year":"1989","journal-title":"J. Graph Theory"},{"key":"10.1016\/S0096-3003(98)10041-3_BIB5","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1002\/net.3230240405","article-title":"On super i-connected graphs","volume":"24","author":"Boland","year":"1994","journal-title":"Networks"},{"key":"10.1016\/S0096-3003(98)10041-3_BIB6","doi-asserted-by":"crossref","first-page":"657","DOI":"10.1002\/jgt.3190130603","article-title":"Maximally connected digraphs","volume":"13","author":"F\u00e0brega","year":"1989","journal-title":"J. Graph Theory"},{"key":"10.1016\/S0096-3003(98)10041-3_BIB7","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1016\/0012-365X(87)90151-8","article-title":"Sufficient conditions for maximally connected dense graphs","volume":"63","author":"Soneoka","year":"1987","journal-title":"Discrete Math."},{"key":"10.1016\/S0096-3003(98)10041-3_BIB8","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1016\/0012-365X(92)00051-R","article-title":"The super connectivity of large digraphs and graphs","volume":"124","author":"Fiol","year":"1994","journal-title":"Discrete Math."},{"issue":"6","key":"10.1016\/S0096-3003(98)10041-3_BIB9","doi-asserted-by":"crossref","first-page":"545","DOI":"10.1002\/jgt.3190160603","article-title":"On super-edge connected digraphs and bipartite digraphs","volume":"16","author":"Fiol","year":"1992","journal-title":"J. Graph Theory"}],"container-title":["Applied Mathematics and Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0096300398100413?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0096300398100413?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,18]],"date-time":"2019-04-18T05:00:04Z","timestamp":1555563604000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0096300398100413"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999,7]]},"references-count":9,"journal-issue":{"issue":"2-3","published-print":{"date-parts":[[1999,7]]}},"alternative-id":["S0096300398100413"],"URL":"https:\/\/doi.org\/10.1016\/s0096-3003(98)10041-3","relation":{},"ISSN":["0096-3003"],"issn-type":[{"value":"0096-3003","type":"print"}],"subject":[],"published":{"date-parts":[[1999,7]]}}}