{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,12]],"date-time":"2026-05-12T14:53:50Z","timestamp":1778597630900,"version":"3.51.4"},"reference-count":7,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1985,7,1]],"date-time":"1985-07-01T00:00:00Z","timestamp":489024000000},"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":10243,"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":[[1985,7]]},"DOI":"10.1016\/0166-218x(85)90075-7","type":"journal-article","created":{"date-parts":[[2002,10,8]],"date-time":"2002-10-08T15:17:01Z","timestamp":1034090221000},"page":"233-243","source":"Crossref","is-referenced-by-count":44,"title":["Neighbour-connectivity in regular graphs"],"prefix":"10.1016","volume":"11","author":[{"given":"G.","family":"Gunther","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0166-218X(85)90075-7_BIB1","doi-asserted-by":"crossref","first-page":"261","DOI":"10.1002\/net.3230020306","article-title":"A general class of invulnerable graphs","volume":"2","author":"Boesch","year":"1972","journal-title":"Networks"},{"issue":"2","key":"10.1016\/0166-218X(85)90075-7_BIB2","doi-asserted-by":"crossref","first-page":"418","DOI":"10.1137\/0132034","article-title":"On designing a reliable hierarchical structure","volume":"32","author":"Goodman","year":"1977","journal-title":"SIAM J. Appl. Math."},{"key":"10.1016\/0166-218X(85)90075-7_BIB3","series-title":"Proc. Eighth Manitoba Conference on Numerical Mathematics and Computing","article-title":"On minimizing the effects of betrayals in a resistance movement","author":"Gunther","year":"1978"},{"key":"10.1016\/0166-218X(85)90075-7_BIB4","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1016\/0166-218X(80)90042-6","article-title":"Optimal k-secure graphs","volume":"2","author":"Gunther","year":"1980","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/0166-218X(85)90075-7_BIB5","series-title":"Proc. Tenth Southeastern Conference on Combinations, Graph Theory and Computing","first-page":"293","article-title":"The optimum defense against random subversions in a network","author":"Hartnell","year":"1979"},{"key":"10.1016\/0166-218X(85)90075-7_BIB6","first-page":"1277","article-title":"Command Graphs","volume":"10","author":"Simmons","year":"1973"},{"key":"10.1016\/0166-218X(85)90075-7_BIB7","series-title":"Applied Combinations","author":"Tucker","year":"1980"}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X85900757?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X85900757?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,9]],"date-time":"2019-04-09T04:27:24Z","timestamp":1554784044000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0166218X85900757"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1985,7]]},"references-count":7,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1985,7]]}},"alternative-id":["0166218X85900757"],"URL":"https:\/\/doi.org\/10.1016\/0166-218x(85)90075-7","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[1985,7]]}}}