{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,11]],"date-time":"2025-09-11T19:46:08Z","timestamp":1757619968522,"version":"3.44.0"},"reference-count":12,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2025,7,28]],"date-time":"2025-07-28T00:00:00Z","timestamp":1753660800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2025,7,28]],"date-time":"2025-07-28T00:00:00Z","timestamp":1753660800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100005357","name":"Agent\u00fa na Podporu V\u00ddskumu a V\u00ddvoja","doi-asserted-by":"publisher","award":["APVV-23-0191"],"award-info":[{"award-number":["APVV-23-0191"]}],"id":[{"id":"10.13039\/501100005357","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100006109","name":"Vedeck\u00e1 Grantov\u00e1 Agent\u00fara M\u0160VVa\u0160 SR a SAV","doi-asserted-by":"publisher","award":["1\/0243\/23"],"award-info":[{"award-number":["1\/0243\/23"]}],"id":[{"id":"10.13039\/501100006109","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Graphs and Combinatorics"],"published-print":{"date-parts":[[2025,8]]},"abstract":"<jats:title>Abstract<\/jats:title>\n          <jats:p>A coloring of the vertex set of a graph using the colors red and blue is a closed neighborhood balanced coloring if for each vertex there are an equal number of red and blue vertices in its closed neighborhood. A graph with such a coloring is called a CNBC graph. Freyberg and Marr (Graphs Combin 40:41, 2024) studied the related class of NBC graphs where closed neighborhood is replaced by open neighborhood. We prove results about CNBC graphs and NBC graphs. We show that the class of CNBC graphs is not hereditary, that the sizes of the color classes can be arbitrarily different, and that if the sizes of the color classes are equal, then a graph is a CNBC graph if and only if its complement is an NBC graph. When the sizes of the color classes are equal, we show that the join of two CNBC graphs is a CNBC graph, and the lexicographic product of a CNBC graph with any graph is a CNBC graph. We prove that the Cartesian product of any CNBC graph and any NBC graph is a CNBC graph, and characterize when a hypercube is an NBC graph or a CNBC graph, but show that the product of two CNBC graphs need not be an NBC graph. We show that the strong product of a CNBC graph with any graph is a CNBC graph. We construct infinite families of circulants that are CNBC graphs, and give characterizations of CNBC trees, generalized Petersen graphs, cubic circulants and quintic circulants when <jats:inline-formula>\n              <jats:tex-math>$$n\\equiv 2 \\pmod 4$$<\/jats:tex-math>\n            <\/jats:inline-formula>.<\/jats:p>","DOI":"10.1007\/s00373-025-02950-5","type":"journal-article","created":{"date-parts":[[2025,7,28]],"date-time":"2025-07-28T10:09:43Z","timestamp":1753697383000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Closed Neighborhood Balanced Coloring of Graphs"],"prefix":"10.1007","volume":"41","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-3799-1157","authenticated-orcid":false,"given":"K. L.","family":"Collins","sequence":"first","affiliation":[]},{"given":"M.","family":"Bowie","sequence":"additional","affiliation":[]},{"given":"N. B.","family":"Fox","sequence":"additional","affiliation":[]},{"given":"B.","family":"Freyberg","sequence":"additional","affiliation":[]},{"given":"J.","family":"Hook","sequence":"additional","affiliation":[]},{"given":"A. M.","family":"Marr","sequence":"additional","affiliation":[]},{"given":"C.","family":"McBee","sequence":"additional","affiliation":[]},{"given":"A.","family":"Semani\u010dov\u00e1-Fe\u0148ov\u010d\u00edkov\u00e1","sequence":"additional","affiliation":[]},{"given":"A.","family":"Sinko","sequence":"additional","affiliation":[]},{"given":"A. N.","family":"Trenk","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,7,28]]},"reference":[{"doi-asserted-by":"publisher","unstructured":"Asaeedi, S.: NP-completeness of neighborhood balanced colorings, preprint, https:\/\/doi.org\/10.48550\/arXiv.2407.19793","key":"2950_CR1","DOI":"10.48550\/arXiv.2407.19793"},{"key":"2950_CR2","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1016\/0095-8956(72)90016-0","volume":"12","author":"NL Biggs","year":"1972","unstructured":"Biggs, N.L., Damerell, R.M., Sands, D.A.: Recursive families of graphs. J. Comb. Theory Ser. B 12, 123\u2013131 (1972)","journal-title":"J. Comb. Theory Ser. B"},{"doi-asserted-by":"publisher","unstructured":"Chakrabarti, D.: Graph mining, in encyclopedia of machine learning, In: Sammut and Webb (eds), Springer, Boston, pp. 469-471 (2010) https:\/\/doi.org\/10.1007\/978-0-387-30164-8_350","key":"2950_CR3","DOI":"10.1007\/978-0-387-30164-8_350"},{"issue":"10","key":"2950_CR4","doi-asserted-by":"publisher","first-page":"10583","DOI":"10.1109\/TKDE.2023.3265598","volume":"35","author":"Y Dong","year":"2023","unstructured":"Dong, Y., Ma, J., Wang, S., Chen, C., Li, J.: Fairness in graph mining: a survey. IEEE Trans. Knowl. Data Eng. 35(10), 10583\u201310602 (2023)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"2950_CR5","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1007\/s00373-024-02766-9","volume":"40","author":"B Freyberg","year":"2024","unstructured":"Freyberg, B., Marr, A.: Neighborhood balanced colorings of graphs. Graphs Combin. 40, 41 (2024)","journal-title":"Graphs Combin."},{"doi-asserted-by":"publisher","unstructured":"Liu, T., Li, P., Liu, H.: Dual-node and edge-aware graph partitions, preprint, https:\/\/doi.org\/10.48550\/arXiv.2306.10123","key":"2950_CR6","DOI":"10.48550\/arXiv.2306.10123"},{"key":"2950_CR7","volume":"477","author":"T Madaras","year":"2024","unstructured":"Madaras, T., Matisov\u00e1, D., Onderko, A., \u0160\u00e1ro\u0161iov\u00e1, Z.: Proper interval vertex colorings of graphs. Appl. Math. Comput. 477, 128813 (2024)","journal-title":"Appl. Math. Comput."},{"doi-asserted-by":"publisher","unstructured":"Minyard, M., Sepanski, M.: Neighborhood balanced 3-colorings, preprint, https:\/\/doi.org\/10.48550\/arXiv.2410.05422","key":"2950_CR8","DOI":"10.48550\/arXiv.2410.05422"},{"key":"2950_CR9","doi-asserted-by":"publisher","first-page":"385","DOI":"10.1016\/j.dam.2022.07.018","volume":"321","author":"M Petru\u0161evski","year":"2022","unstructured":"Petru\u0161evski, M., \u0160krekovski, R.: Colorings with neighborhood parity condition. Discrete Appl. Math. 321, 385\u2013391 (2022)","journal-title":"Discrete Appl. Math."},{"issue":"4","key":"2950_CR10","doi-asserted-by":"publisher","first-page":"545","DOI":"10.1002\/jgt.3190100414","volume":"10","author":"ER Scheinerman","year":"1986","unstructured":"Scheinerman, E.R.: On the structure of hereditary classes of graphs. J. Graph Theory 10(4), 545\u2013551 (1986)","journal-title":"J. Graph Theory"},{"issue":"2","key":"2950_CR11","doi-asserted-by":"publisher","first-page":"152","DOI":"10.1016\/S0021-9800(69)80116-X","volume":"6","author":"ME Watkins","year":"1969","unstructured":"Watkins, M.E.: A theorem on Tait colorings with an application to the generalized Petersen graphs. J. Comb. Theory 6(2), 152\u2013164 (1969)","journal-title":"J. Comb. Theory"},{"key":"2950_CR12","volume-title":"Introduction to Graph Theory","author":"DB West","year":"2001","unstructured":"West, D.B.: Introduction to Graph Theory, 2nd edn. Prentice Hall, Upper Saddle River (2001)","edition":"2"}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-025-02950-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00373-025-02950-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-025-02950-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,9,8]],"date-time":"2025-09-08T04:27:37Z","timestamp":1757305657000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00373-025-02950-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,7,28]]},"references-count":12,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2025,8]]}},"alternative-id":["2950"],"URL":"https:\/\/doi.org\/10.1007\/s00373-025-02950-5","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"type":"print","value":"0911-0119"},{"type":"electronic","value":"1435-5914"}],"subject":[],"published":{"date-parts":[[2025,7,28]]},"assertion":[{"value":"3 December 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"2 July 2025","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"28 July 2025","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare that they have no Conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"88"}}