{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,30]],"date-time":"2025-07-30T13:22:33Z","timestamp":1753881753176,"version":"3.41.2"},"reference-count":11,"publisher":"World Scientific Pub Co Pte Ltd","issue":"01","funder":[{"DOI":"10.13039\/501100004609","name":"Foundation of Henan Educational Committee","doi-asserted-by":"publisher","award":["22A110003"],"award-info":[{"award-number":["22A110003"]}],"id":[{"id":"10.13039\/501100004609","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"crossref","award":["12101203","12301437"],"award-info":[{"award-number":["12101203","12301437"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J. Inter. Net."],"published-print":{"date-parts":[[2025,3]]},"abstract":"<jats:p> The proper rainbow vertex connection number of [Formula: see text], denoted by [Formula: see text], is the smallest number of colors needed to properly color the vertices of [Formula: see text] to make [Formula: see text] rainbow vertex connected. The proper strong rainbow vertex connection number of [Formula: see text], denoted by [Formula: see text], is the smallest number of colors needed to properly color the vertices of [Formula: see text] to make [Formula: see text] strong rainbow vertex connected. These two concepts are inspired by the concepts of proper (strong) rainbow connection number of graphs. In this paper, we determine the values of [Formula: see text] and [Formula: see text] of [Formula: see text] with large clique numbers [Formula: see text] and [Formula: see text]. Moreover, we determine the values of [Formula: see text] and [Formula: see text] of [Formula: see text] with large clique numbers [Formula: see text], [Formula: see text] and [Formula: see text]. <\/jats:p>","DOI":"10.1142\/s0219265923500342","type":"journal-article","created":{"date-parts":[[2024,1,21]],"date-time":"2024-01-21T04:25:16Z","timestamp":1705811116000},"source":"Crossref","is-referenced-by-count":0,"title":["Proper (Strong) Rainbow Connection and Proper (Strong) Rainbow Vertex Connection of Graphs with Large Clique Number"],"prefix":"10.1142","volume":"25","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-0380-9468","authenticated-orcid":false,"given":"Yingbin","family":"Ma","sequence":"first","affiliation":[{"name":"College of Mathematics and Information Science, Henan Normal University, Xinxiang 453007, P. R. China"}]},{"given":"Yanfeng","family":"Xue","sequence":"additional","affiliation":[{"name":"College of Mathematics and Information Science, Henan Normal University, Xinxiang 453007, P. R. China"}]},{"given":"Xiaoxue","family":"Zhang","sequence":"additional","affiliation":[{"name":"College of Mathematics and Information Science, Henan Normal University, Xinxiang 453007, P. R. China"}]}],"member":"219","published-online":{"date-parts":[[2024,1,19]]},"reference":[{"key":"S0219265923500342BIB001","first-page":"381","volume":"71","author":"Bau S.","year":"2018","journal-title":"Australas. J. Combin."},{"key":"S0219265923500342BIB002","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-84628-970-5"},{"key":"S0219265923500342BIB003","doi-asserted-by":"publisher","DOI":"10.21136\/MB.2008.133947"},{"key":"S0219265923500342BIB004","doi-asserted-by":"publisher","DOI":"10.7151\/dmgt.2326"},{"key":"S0219265923500342BIB005","doi-asserted-by":"publisher","DOI":"10.7151\/dmgt.2201"},{"key":"S0219265923500342BIB006","doi-asserted-by":"publisher","DOI":"10.7151\/dmgt.1547"},{"key":"S0219265923500342BIB007","doi-asserted-by":"publisher","DOI":"10.1002\/jgt.20418"},{"key":"S0219265923500342BIB008","doi-asserted-by":"publisher","DOI":"10.1007\/s00373-012-1243-2"},{"key":"S0219265923500342BIB009","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4614-3119-0"},{"key":"S0219265923500342BIB010","doi-asserted-by":"publisher","DOI":"10.1007\/s11425-014-4905-0"},{"key":"S0219265923500342BIB011","doi-asserted-by":"publisher","DOI":"10.1142\/S0219265922500062"}],"container-title":["Journal of Interconnection Networks"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S0219265923500342","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,6]],"date-time":"2025-02-06T02:13:19Z","timestamp":1738807999000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/10.1142\/S0219265923500342"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,1,19]]},"references-count":11,"journal-issue":{"issue":"01","published-print":{"date-parts":[[2025,3]]}},"alternative-id":["10.1142\/S0219265923500342"],"URL":"https:\/\/doi.org\/10.1142\/s0219265923500342","relation":{},"ISSN":["0219-2659","1793-6713"],"issn-type":[{"type":"print","value":"0219-2659"},{"type":"electronic","value":"1793-6713"}],"subject":[],"published":{"date-parts":[[2024,1,19]]},"article-number":"2350034"}}