{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,5,24]],"date-time":"2022-05-24T16:13:17Z","timestamp":1653408797421},"reference-count":14,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[1993,11,1]],"date-time":"1993-11-01T00:00:00Z","timestamp":752112000000},"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":7198,"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":[[1993,11]]},"DOI":"10.1016\/0012-365x(93)90299-9","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T23:46:59Z","timestamp":1027640819000},"page":"245-253","source":"Crossref","is-referenced-by-count":6,"title":["On the edge-integrity of some graphs and their complements"],"prefix":"10.1016","volume":"122","author":[{"given":"R.","family":"Laskar","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"S.","family":"Stuecle","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"B.","family":"Piazza","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0012-365X(93)90299-9_BIB1","unstructured":"K.S. Bagga, L.W. Beineke, M.J. Lipman and R.E. Pippert, Bounds and an algorithm for the edge-integrity of trees, submitted."},{"key":"10.1016\/0012-365X(93)90299-9_BIB2","doi-asserted-by":"crossref","unstructured":"K.S. Bagga, L.W. Beineke, M.J. Lipman and R.E. Pippert, A classification scheme for vulnerability and reliability parameters of graphs, Congr. Numer., to appear.","DOI":"10.1016\/0895-7177(93)90246-U"},{"key":"10.1016\/0012-365X(93)90299-9_BIB3","unstructured":"K.S. Bagga, L.W. Beineke, M.J. Lipman and R.E. Pippert, Extensions of an algorithm for computing the edge-integrity of a tree, submitted."},{"key":"10.1016\/0012-365X(93)90299-9_BIB4","first-page":"141","article-title":"On the edge-integrity of graphs","volume":"60","author":"Bagga","year":"1987","journal-title":"Congr. Numer."},{"key":"10.1016\/0012-365X(93)90299-9_BIB5","first-page":"225","article-title":"A good algorithm for the computation of the edge-integrity of trees","volume":"67","author":"Bagga","year":"1988","journal-title":"Congr. Numer."},{"key":"10.1016\/0012-365X(93)90299-9_BIB6","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0012-365X(93)90282-X","article-title":"On the honesty of graph complements","volume":"122","author":"Bagga","year":"1993","journal-title":"Discrete Math."},{"key":"10.1016\/0012-365X(93)90299-9_BIB7","first-page":"103","article-title":"Integrity of trees and powers of cycles","volume":"58","author":"Barefoot","year":"1987","journal-title":"Congr. Numer."},{"key":"10.1016\/0012-365X(93)90299-9_BIB8","first-page":"13","article-title":"Vulnerability in graphs-a comparative survey","volume":"1","author":"Barefoot","year":"1987","journal-title":"J. Comb. Math. Comb. Comput."},{"key":"10.1016\/0012-365X(93)90299-9_BIB9","series-title":"Mathematics Series","article-title":"Graphs and Digraphs","author":"Chartrand","year":"1986"},{"key":"10.1016\/0012-365X(93)90299-9_BIB10","first-page":"179","article-title":"Computational complexity of integrity","volume":"2","author":"Clark","year":"1987","journal-title":"J. Comb. Math. Comb. Comput."},{"key":"10.1016\/0012-365X(93)90299-9_BIB11","first-page":"23","article-title":"The immersion order, forbidden subgraphs and the complexity of integrity","volume":"6","author":"Fellows","year":"1989","journal-title":"J. Comb. Math. Comb. Comput."},{"key":"10.1016\/0012-365X(93)90299-9_BIB12","series-title":"Computer Science and Applied Mathematics","article-title":"Algorithmic Graph Theory and Perfect Graphs","author":"Golumbic","year":"1980"},{"key":"10.1016\/0012-365X(93)90299-9_BIB13","first-page":"149","article-title":"On the vulnerability of permutation graphs of complete and complete bipartite graphs","volume":"31","author":"Guichard","year":"1991","journal-title":"Ars Combin."},{"key":"10.1016\/0012-365X(93)90299-9_BIB14","first-page":"289","article-title":"On the vulnerability of cycle permutation graphs","volume":"29","author":"Piazza","year":"1990","journal-title":"Ars Combin."}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X93902999?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X93902999?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T00:27:53Z","timestamp":1555115273000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0012365X93902999"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993,11]]},"references-count":14,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[1993,11]]}},"alternative-id":["0012365X93902999"],"URL":"https:\/\/doi.org\/10.1016\/0012-365x(93)90299-9","relation":{},"ISSN":["0012-365X"],"issn-type":[{"value":"0012-365X","type":"print"}],"subject":[],"published":{"date-parts":[[1993,11]]}}}