{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,10,20]],"date-time":"2023-10-20T07:02:14Z","timestamp":1697785334529},"reference-count":6,"publisher":"Wiley","issue":"3","license":[{"start":{"date-parts":[[2006,10,3]],"date-time":"2006-10-03T00:00:00Z","timestamp":1159833600000},"content-version":"vor","delay-in-days":9894,"URL":"http:\/\/onlinelibrary.wiley.com\/termsAndConditions#vor"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Graph Theory"],"published-print":{"date-parts":[[1979,9]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>A description is obtained for connected graphs in which a point <jats:italic>u<\/jats:italic> is adjacent of <jats:italic>v<\/jats:italic> only if <jats:italic>u<\/jats:italic> is adjacent to all points whose degree is greater than that of <jats:italic>v<\/jats:italic>. The minimum number of lines in such a grpah with all points having degree at least <jats:italic>d<\/jats:italic> is also determined. Finally, an application to communication systems is discussed.<\/jats:p>","DOI":"10.1002\/jgt.3190030308","type":"journal-article","created":{"date-parts":[[2007,5,26]],"date-time":"2007-05-26T10:24:56Z","timestamp":1180175096000},"page":"257-262","source":"Crossref","is-referenced-by-count":5,"title":["Class of graphs with restricted neighborhoods"],"prefix":"10.1002","volume":"3","author":[{"given":"Kim T.","family":"Rawlinson","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"R. C.","family":"Entringer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"311","published-online":{"date-parts":[[2006,10,3]]},"reference":[{"key":"e_1_2_1_2_2","doi-asserted-by":"crossref","first-page":"283","DOI":"10.21136\/CMJ.1976.101401","article-title":"Distance in graphs","volume":"26","author":"Entringer R. C.","year":"1976","journal-title":"Czechoslovak Math. J."},{"key":"e_1_2_1_3_2","doi-asserted-by":"publisher","DOI":"10.1109\/TCS.1977.1084370"},{"key":"e_1_2_1_4_2","volume-title":"Proceedings of the Eighth Southeastern Conference on Combinatorics, Graph Theory and Computing","author":"Foldes S.","year":"1977"},{"key":"e_1_2_1_5_2","doi-asserted-by":"crossref","unstructured":"F.Harary Graph Theory. Addison\u2010Wesley Reading Mass. (1969).","DOI":"10.21236\/AD0705364"},{"key":"e_1_2_1_6_2","doi-asserted-by":"publisher","DOI":"10.1037\/h0057189"},{"key":"e_1_2_1_7_2","doi-asserted-by":"publisher","DOI":"10.1016\/0095-8956(75)90072-6"}],"container-title":["Journal of Graph Theory"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.wiley.com\/onlinelibrary\/tdm\/v1\/articles\/10.1002%2Fjgt.3190030308","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1002\/jgt.3190030308","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,10,19]],"date-time":"2023-10-19T13:12:57Z","timestamp":1697721177000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1002\/jgt.3190030308"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1979,9]]},"references-count":6,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1979,9]]}},"alternative-id":["10.1002\/jgt.3190030308"],"URL":"https:\/\/doi.org\/10.1002\/jgt.3190030308","archive":["Portico"],"relation":{},"ISSN":["0364-9024","1097-0118"],"issn-type":[{"value":"0364-9024","type":"print"},{"value":"1097-0118","type":"electronic"}],"subject":[],"published":{"date-parts":[[1979,9]]}}}