{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,7]],"date-time":"2025-07-07T07:26:35Z","timestamp":1751873195406},"reference-count":25,"publisher":"Wiley","issue":"3","license":[{"start":{"date-parts":[[2006,10,5]],"date-time":"2006-10-05T00:00:00Z","timestamp":1160006400000},"content-version":"vor","delay-in-days":4844,"URL":"http:\/\/onlinelibrary.wiley.com\/termsAndConditions#vor"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Graph Theory"],"published-print":{"date-parts":[[1993,7]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>For (weighted) graphs several labeling properties and their relation to the eigenvalues of the Laplacian matrix of a graph are considered. Several upper and lower bounds on the bandwidth and other min\u2010sum problems are derived. Most of these bounds depend on Laplace eigenvalues of the graphs. The results are applied in the study of bandwidth and the min\u2010sums of random graphs, random regular graphs, and Kneser graphs. \u00a9 John Wiley &amp; Sons, Inc.<\/jats:p>","DOI":"10.1002\/jgt.3190170313","type":"journal-article","created":{"date-parts":[[2007,5,26]],"date-time":"2007-05-26T13:17:31Z","timestamp":1180185451000},"page":"393-407","source":"Crossref","is-referenced-by-count":26,"title":["Laplace eigenvalues and bandwidth\u2010type invariants of graphs"],"prefix":"10.1002","volume":"17","author":[{"given":"Martin","family":"Juvan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bojan","family":"Mohar","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"311","published-online":{"date-parts":[[2006,10,5]]},"reference":[{"key":"e_1_2_1_2_2","doi-asserted-by":"publisher","DOI":"10.1007\/BF02579166"},{"key":"e_1_2_1_3_2","doi-asserted-by":"publisher","DOI":"10.1016\/0095-8956(85)90092-9"},{"key":"e_1_2_1_4_2","first-page":"5","article-title":"Constructions of telephone networks by group representations","volume":"36","author":"Bien F.","year":"1989","journal-title":"Notices Am. Math. Soc."},{"key":"e_1_2_1_5_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-9967-7"},{"key":"e_1_2_1_6_2","doi-asserted-by":"publisher","DOI":"10.1002\/jgt.3190060302"},{"key":"e_1_2_1_7_2","unstructured":"P.Chiu Cubic Ramanujan graphs. Preprint (1989)."},{"key":"e_1_2_1_8_2","first-page":"151","volume-title":"Selected Topics in Graph Theory 3","author":"Chung F. R. K.","year":"1988"},{"key":"e_1_2_1_9_2","doi-asserted-by":"publisher","DOI":"10.21136\/CMJ.1973.101168"},{"key":"e_1_2_1_10_2","doi-asserted-by":"publisher","DOI":"10.1007\/BF01591018"},{"key":"e_1_2_1_11_2","doi-asserted-by":"publisher","DOI":"10.1007\/BF01275669"},{"key":"e_1_2_1_12_2","doi-asserted-by":"publisher","DOI":"10.1007\/BF02579329"},{"key":"e_1_2_1_13_2","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(76)90059-1"},{"key":"e_1_2_1_14_2","doi-asserted-by":"publisher","DOI":"10.1016\/0012-365X(91)90470-M"},{"key":"e_1_2_1_15_2","doi-asserted-by":"publisher","DOI":"10.1016\/0166-218X(92)90229-4"},{"key":"e_1_2_1_16_2","doi-asserted-by":"publisher","DOI":"10.1016\/0012-365X(81)90276-4"},{"key":"e_1_2_1_17_2","first-page":"29","article-title":"On the bandwidth of a random graph","volume":"20","author":"Kuang Y.","year":"1985","journal-title":"Ars Combinat."},{"key":"e_1_2_1_18_2","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1979.1055985"},{"key":"e_1_2_1_19_2","doi-asserted-by":"publisher","DOI":"10.1007\/BF02126799"},{"key":"e_1_2_1_20_2","first-page":"871","volume-title":"Graph Theory, Combinatorics, and Applications","author":"Mohar B.","year":"1991"},{"key":"e_1_2_1_21_2","doi-asserted-by":"publisher","DOI":"10.1016\/0095-8956(89)90029-4"},{"key":"e_1_2_1_22_2","first-page":"51","article-title":"Explicit group\u2010theoretical constructions of combinatorial schemes and their applications to the design of expanders and superconcentrators","volume":"24","author":"Margulis G. A.","year":"1988","journal-title":"Problemy Peredachi Informatsii"},{"key":"e_1_2_1_22_3","first-page":"39","volume":"24","year":"1988","journal-title":"Problems of Information Transmission"},{"key":"e_1_2_1_23_2","doi-asserted-by":"crossref","first-page":"343","DOI":"10.21136\/CMJ.1990.102386","article-title":"Eigenvalues and the max\u2010cut problem","volume":"40","author":"Mohar B.","year":"1990","journal-title":"Czech. Math. J."},{"key":"e_1_2_1_24_2","volume-title":"Combinatorial and Graph\u2010Theoretic Problems in Linear Algebra","author":"Mohar B."},{"key":"e_1_2_1_25_2","doi-asserted-by":"publisher","DOI":"10.1007\/BF02280884"}],"container-title":["Journal of Graph Theory"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.wiley.com\/onlinelibrary\/tdm\/v1\/articles\/10.1002%2Fjgt.3190170313","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1002\/jgt.3190170313","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,10,25]],"date-time":"2023-10-25T12:09:06Z","timestamp":1698235746000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1002\/jgt.3190170313"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993,7]]},"references-count":25,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1993,7]]}},"alternative-id":["10.1002\/jgt.3190170313"],"URL":"https:\/\/doi.org\/10.1002\/jgt.3190170313","archive":["Portico"],"relation":{},"ISSN":["0364-9024","1097-0118"],"issn-type":[{"value":"0364-9024","type":"print"},{"value":"1097-0118","type":"electronic"}],"subject":[],"published":{"date-parts":[[1993,7]]}}}