{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,27]],"date-time":"2026-03-27T14:49:13Z","timestamp":1774622953514,"version":"3.50.1"},"reference-count":14,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[1994,1,1]],"date-time":"1994-01-01T00:00:00Z","timestamp":757382400000},"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":7137,"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":[[1994,1]]},"DOI":"10.1016\/0012-365x(94)90084-1","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:43:34Z","timestamp":1027655014000},"page":"3-12","source":"Crossref","is-referenced-by-count":25,"title":["Edge-integrity: a survey"],"prefix":"10.1016","volume":"124","author":[{"given":"K.S.","family":"Bagga","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"L.W.","family":"Beineke","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"M.J.","family":"Lipman","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"R.E.","family":"Pippert","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0012-365X(94)90084-1_BIB1","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(94)90084-1_BIB2","unstructured":"K.S. Bagga, L.W. Beineke, M.J. Lipman, R.E. Pippert and R.L. Sedlmeyer, Some bounds and an algorithm for the edge-integrity of trees, submitted."},{"key":"10.1016\/0012-365X(94)90084-1_BIB3","doi-asserted-by":"crossref","unstructured":"K.S. Bagga, L.W. Beineke, M.J. Lipman and R.E. Pippert, On the honesty of graph complements, Discrete Appl. Math., to appear.","DOI":"10.1016\/0012-365X(93)90282-X"},{"key":"10.1016\/0012-365X(94)90084-1_BIB4","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1016\/0166-218X(92)90122-Q","article-title":"A survey of integrity","volume":"37\/38","author":"Bagga","year":"1992","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/0012-365X(94)90084-1_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(94)90084-1_BIB6","first-page":"12","article-title":"Vulnerability in graphs \u2014 A comparative survey","volume":"1","author":"Barefoot","year":"1987","journal-title":"J. Combin. Math. Combin. Comput."},{"key":"10.1016\/0012-365X(94)90084-1_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(94)90084-1_BIB8","first-page":"191","article-title":"The Integrity of the Cube is Small","volume":"9","author":"Beineke","year":"1991","journal-title":"J. Combin. Math. Combin. Comput."},{"key":"10.1016\/0012-365X(94)90084-1_BIB9","unstructured":"L.W. Beineke, W.D. Goddard and M.J. Lipman, Edge-integrity and the diameter of a graph, in preparation."},{"key":"10.1016\/0012-365X(94)90084-1_BIB10","unstructured":"L.W. Beineke, W.D. Goddard and M.J. Lipman, On the edge-integrity of graph products, in preparation."},{"key":"10.1016\/0012-365X(94)90084-1_BIB11","first-page":"179","article-title":"Computational complexity of integrity","volume":"2","author":"Clark","year":"1987","journal-title":"J. Combin. Math. Combin. Comput."},{"key":"10.1016\/0012-365X(94)90084-1_BIB12","unstructured":"M.R. Fellows and S. Stueckle, The immersion order, forbidden subgrahs and the complexity of network integrity, J. Combin. Math. Combin. Comput., to appear."},{"key":"10.1016\/0012-365X(94)90084-1_BIB13","series-title":"Ph.D. Thesis","article-title":"On the Vulnerability of Graphs","author":"Goddard","year":"1989"},{"key":"10.1016\/0012-365X(94)90084-1_BIB14","unstructured":"R. Laskar, S. Stueckle and B. Piazza, On the edge-integrity of some graphs and their complements, submitted."}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X94900841?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X94900841?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T05:57:58Z","timestamp":1555135078000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0012365X94900841"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994,1]]},"references-count":14,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[1994,1]]}},"alternative-id":["0012365X94900841"],"URL":"https:\/\/doi.org\/10.1016\/0012-365x(94)90084-1","relation":{},"ISSN":["0012-365X"],"issn-type":[{"value":"0012-365X","type":"print"}],"subject":[],"published":{"date-parts":[[1994,1]]}}}