{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,30]],"date-time":"2025-07-30T13:10:18Z","timestamp":1753881018277,"version":"3.41.2"},"reference-count":7,"publisher":"World Scientific Pub Co Pte Ltd","issue":"01","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Math. Algorithm. Appl."],"published-print":{"date-parts":[[2023,1]]},"abstract":"<jats:p> The rotational dimension is a minor-monotone graph invariant related to the dimension of a Euclidean space containing a spectral embedding corresponding to the first nonzero eigenvalue of the graph Laplacian, which is introduced by G\u00f6ring, Helmberg and Wappler. In this paper, we study rotational dimensions of graphs which contain large complete graphs. The complete graph is characterized by its rotational dimension. It will be obtained that a chordal graph may be made large while keeping the rotational dimension constant. <\/jats:p>","DOI":"10.1142\/s1793830922500616","type":"journal-article","created":{"date-parts":[[2022,3,1]],"date-time":"2022-03-01T01:17:50Z","timestamp":1646097470000},"source":"Crossref","is-referenced-by-count":0,"title":["Embedding and the rotational dimension of a graph containing a clique"],"prefix":"10.1142","volume":"15","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-8314-2722","authenticated-orcid":false,"given":"Takumi","family":"Gomyou","sequence":"first","affiliation":[{"name":"Graduate School of Mathematics, Nagoya University, Chikusa-ku, Nagoya 464-8602, Japan"}]}],"member":"219","published-online":{"date-parts":[[2022,2,25]]},"reference":[{"key":"S1793830922500616BIB001","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(97)00228-4"},{"key":"S1793830922500616BIB002","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511804441"},{"key":"S1793830922500616BIB003","doi-asserted-by":"crossref","first-page":"57","DOI":"10.4064\/-25-1-57-70","volume":"25","author":"Fiedler M.","year":"1989","journal-title":"Banach Center Publ."},{"key":"S1793830922500616BIB004","doi-asserted-by":"crossref","first-page":"472","DOI":"10.1137\/050639430","volume":"19","author":"G\u00f6ring F.","year":"2008","journal-title":"SIAM J. Optim."},{"key":"S1793830922500616BIB005","doi-asserted-by":"crossref","first-page":"283","DOI":"10.1002\/jgt.20502","volume":"66","author":"G\u00f6ring F.","year":"2011","journal-title":"J. Graph Theory."},{"issue":"2","key":"S1793830922500616BIB006","doi-asserted-by":"crossref","first-page":"291","DOI":"10.1006\/jctb.1995.1056","volume":"65","author":"Van der Holst H.","year":"1995","journal-title":"J. Combin. Theory Ser. B"},{"key":"S1793830922500616BIB007","series-title":"Bolyai Society Mathematical Studies","first-page":"29","volume-title":"Graph Theory and Combinatorial Biology","volume":"7","author":"Van der Holst H.","year":"1999"}],"container-title":["Discrete Mathematics, Algorithms and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S1793830922500616","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,3]],"date-time":"2023-02-03T05:24:10Z","timestamp":1675401850000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/10.1142\/S1793830922500616"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,2,25]]},"references-count":7,"journal-issue":{"issue":"01","published-print":{"date-parts":[[2023,1]]}},"alternative-id":["10.1142\/S1793830922500616"],"URL":"https:\/\/doi.org\/10.1142\/s1793830922500616","relation":{},"ISSN":["1793-8309","1793-8317"],"issn-type":[{"type":"print","value":"1793-8309"},{"type":"electronic","value":"1793-8317"}],"subject":[],"published":{"date-parts":[[2022,2,25]]},"article-number":"2250061"}}