{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,30]],"date-time":"2025-07-30T13:10:10Z","timestamp":1753881010376,"version":"3.41.2"},"reference-count":11,"publisher":"World Scientific Pub Co Pte Ltd","issue":"04","funder":[{"name":"DST-SERB-SRG","award":["SRG\/2019\/000475"],"award-info":[{"award-number":["SRG\/2019\/000475"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Math. Algorithm. Appl."],"published-print":{"date-parts":[[2022,5]]},"abstract":"<jats:p> The neighborhood graph [Formula: see text] of a graph [Formula: see text] has the same vertex set as [Formula: see text] and two vertices are adjacent in [Formula: see text] if and only if they have a common neighbor in [Formula: see text]. We study the domination number, independence number and chromatic number of [Formula: see text] in terms of those of [Formula: see text]. Moreover we investigate various structural similarities between [Formula: see text] and [Formula: see text]. <\/jats:p>","DOI":"10.1142\/s1793830921501330","type":"journal-article","created":{"date-parts":[[2021,4,28]],"date-time":"2021-04-28T14:14:50Z","timestamp":1619619290000},"source":"Crossref","is-referenced-by-count":1,"title":["On neighborhood graphs: Domination, coloring and other properties"],"prefix":"10.1142","volume":"14","author":[{"given":"Angsuman","family":"Das","sequence":"first","affiliation":[{"name":"Department of Mathematics, Presidency University, Kolkata, India"}]}],"member":"219","published-online":{"date-parts":[[2021,5,17]]},"reference":[{"key":"S1793830921501330BIB001","doi-asserted-by":"publisher","DOI":"10.12988\/ijma.2015.58190"},{"key":"S1793830921501330BIB002","first-page":"101","volume":"12","author":"Boland J. W.","year":"1987","journal-title":"J. Combin. Syst. Sci."},{"key":"S1793830921501330BIB003","first-page":"151","volume":"58","author":"Boland J. W.","year":"1987","journal-title":"Congress. Numer."},{"key":"S1793830921501330BIB004","doi-asserted-by":"publisher","DOI":"10.4153\/CMB-1968-063-0"},{"key":"S1793830921501330BIB005","first-page":"75","volume":"12","author":"Brigham R. C.","year":"1987","journal-title":"J. Combin. Syst. Sci."},{"key":"S1793830921501330BIB006","doi-asserted-by":"publisher","DOI":"10.1007\/s00373-017-1789-0"},{"key":"S1793830921501330BIB007","doi-asserted-by":"publisher","DOI":"10.1016\/j.endm.2013.11.011"},{"key":"S1793830921501330BIB008","doi-asserted-by":"publisher","DOI":"10.2989\/16073606.2015.1113211"},{"key":"S1793830921501330BIB009","doi-asserted-by":"publisher","DOI":"10.1007\/s00373-010-0909-x"},{"key":"S1793830921501330BIB010","doi-asserted-by":"publisher","DOI":"10.1007\/s40840-015-0231-0"},{"volume-title":"Introduction to Graph Theory","year":"2001","author":"West D. B.","key":"S1793830921501330BIB011"}],"container-title":["Discrete Mathematics, Algorithms and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S1793830921501330","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,5,19]],"date-time":"2022-05-19T08:47:29Z","timestamp":1652950049000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/10.1142\/S1793830921501330"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,5,17]]},"references-count":11,"journal-issue":{"issue":"04","published-print":{"date-parts":[[2022,5]]}},"alternative-id":["10.1142\/S1793830921501330"],"URL":"https:\/\/doi.org\/10.1142\/s1793830921501330","relation":{},"ISSN":["1793-8309","1793-8317"],"issn-type":[{"type":"print","value":"1793-8309"},{"type":"electronic","value":"1793-8317"}],"subject":[],"published":{"date-parts":[[2021,5,17]]},"article-number":"2150133"}}