{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,30]],"date-time":"2026-03-30T03:03:50Z","timestamp":1774839830359,"version":"3.50.1"},"reference-count":21,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[1992,7,1]],"date-time":"1992-07-01T00:00:00Z","timestamp":709948800000},"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":7686,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Applied Mathematics"],"published-print":{"date-parts":[[1992,7]]},"DOI":"10.1016\/0166-218x(92)90122-q","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T23:43:01Z","timestamp":1027640581000},"page":"13-28","source":"Crossref","is-referenced-by-count":78,"special_numbering":"C","title":["A survey of integrity"],"prefix":"10.1016","volume":"37-38","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":"W.D.","family":"Goddard","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\/0166-218X(92)90122-Q_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\/0166-218X(92)90122-Q_BIB2","first-page":"12","article-title":"The integrity of the prism (Preliminary report)","volume":"10","author":"Bagga","year":"1989","journal-title":"Abstracts Amer. Math. Soc."},{"key":"10.1016\/0166-218X(92)90122-Q_BIB3","unstructured":"K.S. Bagga, L.W. Beineke, M.J. Lipman and R.E. Pippert, Some bounds and an algorithm for the edge-integrity of trees, J. Combin. Math. Combin. Comput., to appear."},{"key":"10.1016\/0166-218X(92)90122-Q_BIB4","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\/0166-218X(92)90122-Q_BIB5","doi-asserted-by":"crossref","unstructured":"K.S. Bagga, L.W. Beineke, M.J. Lipman and R.E. Pippert, A survey of edge-integrity, Discrete Math., to appear.","DOI":"10.1016\/0012-365X(94)90084-1"},{"key":"10.1016\/0166-218X(92)90122-Q_BIB6","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\/0166-218X(92)90122-Q_BIB7","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\/0166-218X(92)90122-Q_BIB8","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\/0166-218X(92)90122-Q_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\/0166-218X(92)90122-Q_BIB10","unstructured":"L.W. Beineke, W.D. Goddard and M.J. Lipman, On the edge-integrity of graph products, in preparation."},{"key":"10.1016\/0166-218X(92)90122-Q_BIB11","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\/0166-218X(92)90122-Q_BIB12","series-title":"Recent Studies in Graph Theory","article-title":"The mean integrity of a graph","author":"Chartrand","year":"1989"},{"key":"10.1016\/0166-218X(92)90122-Q_BIB13","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\/0166-218X(92)90122-Q_BIB14","first-page":"23","article-title":"The immersion order, forbidden subgraphs and the complexity of network integrity","volume":"6","author":"Fellows","year":"1989","journal-title":"J. Combin. Math. Combin. Comput."},{"key":"10.1016\/0166-218X(92)90122-Q_BIB15","series-title":"Ph.D. thesis","article-title":"On the vulnerability of graphs","author":"Goddard","year":"1989"},{"key":"10.1016\/0166-218X(92)90122-Q_BIB16","unstructured":"W. Goddard, Measures of vulnerability\u2014The integrity family, submitted."},{"key":"10.1016\/0166-218X(92)90122-Q_BIB17","first-page":"3","article-title":"On the integrity of combinations of graphs","volume":"4","author":"Goddard","year":"1988","journal-title":"J. Combin. Math. Combin. Comput."},{"key":"10.1016\/0166-218X(92)90122-Q_BIB18","unstructured":"W. Goddard and H.C. Swart, On some extremal problems in connectivity, in: Y. Alavi et al., eds., Proceedings of the Sixth International Conference on the Theory and Applications of Graphs (Wiley, New York) 535\u2013551."},{"key":"10.1016\/0166-218X(92)90122-Q_BIB19","first-page":"139","article-title":"Integrity in graphs: Bounds and basics","volume":"7","author":"Goddard","year":"1990","journal-title":"J. Combin. Math. Combin. Comput."},{"key":"10.1016\/0166-218X(92)90122-Q_BIB20","doi-asserted-by":"crossref","first-page":"217","DOI":"10.1080\/16073606.1990.9631613","article-title":"On the toughness of a graph","volume":"13","author":"Goddard","year":"1990","journal-title":"Quaestiones Math."},{"key":"10.1016\/0166-218X(92)90122-Q_BIB21","doi-asserted-by":"crossref","unstructured":"R. Laskar, S. Stueckle and B. Piazza, On the edge-integrity of some graphs and their complements, Discrete Math., to appear.","DOI":"10.1016\/0012-365X(93)90299-9"}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X9290122Q?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X9290122Q?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T02:23:51Z","timestamp":1555122231000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0166218X9290122Q"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992,7]]},"references-count":21,"alternative-id":["0166218X9290122Q"],"URL":"https:\/\/doi.org\/10.1016\/0166-218x(92)90122-q","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[1992,7]]}}}