{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,12,5]],"date-time":"2023-12-05T14:20:38Z","timestamp":1701786038024},"reference-count":22,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2013,4,4]],"date-time":"2013-04-04T00:00:00Z","timestamp":1365033600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2015,2]]},"DOI":"10.1007\/s10878-013-9610-3","type":"journal-article","created":{"date-parts":[[2013,4,3]],"date-time":"2013-04-03T09:43:24Z","timestamp":1364982204000},"page":"502-510","source":"Crossref","is-referenced-by-count":1,"title":["Nordhaus\u2013Gaddum-type results for path covering and $$L(2,1)$$ -labeling numbers"],"prefix":"10.1007","volume":"29","author":[{"given":"Damei","family":"L\u00fc","sequence":"first","affiliation":[]},{"given":"Juan","family":"Du","sequence":"additional","affiliation":[]},{"given":"Nianfeng","family":"Lin","sequence":"additional","affiliation":[]},{"given":"Ke","family":"Zhang","sequence":"additional","affiliation":[]},{"given":"Dan","family":"Yi","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2013,4,4]]},"reference":[{"key":"9610_CR1","first-page":"193","volume":"160","author":"H Balakrishnan","year":"2003","unstructured":"Balakrishnan H, Deo N (2003) Parallel algorithm for radiocoloring a graph. Congr Numer 160:193\u2013204","journal-title":"Congr Numer"},{"issue":"8","key":"9610_CR2","doi-asserted-by":"crossref","first-page":"1344","DOI":"10.1093\/comjnl\/bxr037","volume":"54","author":"T Calamoneri","year":"2011","unstructured":"Calamoneri T (2011) The $$L(h, k)$$ -labelling problem: an updated survey and annotated bibliography. Comput J 54(8):1344\u20131371","journal-title":"Comput J"},{"issue":"3","key":"9610_CR3","doi-asserted-by":"crossref","first-page":"414","DOI":"10.1016\/j.jpdc.2003.11.005","volume":"64","author":"T Calamoneri","year":"2004","unstructured":"Calamoneri T, Petreschi R (2004) $$L(h,1)$$ -Labeling subclasses of planar graphs. J Parallel Distrib Comput 64(3):414\u2013426","journal-title":"J Parallel Distrib Comput"},{"issue":"14","key":"9610_CR4","doi-asserted-by":"crossref","first-page":"1534","DOI":"10.1016\/j.disc.2005.04.024","volume":"306","author":"T Calamoneri","year":"2006","unstructured":"Calamoneri T, Pelc A, Petreschi R (2006) Labeling trees with a condition at distance two. Discret Math 306(14):1534\u20131539","journal-title":"Discret Math"},{"key":"9610_CR5","doi-asserted-by":"crossref","first-page":"309","DOI":"10.1137\/S0895480193245339","volume":"9","author":"GJ Chang","year":"1996","unstructured":"Chang GJ, Kuo D (1996) The $$L(2,1)$$ -labelling problem on graphs. SIAM J Discret Math 9:309\u2013316","journal-title":"SIAM J Discret Math"},{"key":"9610_CR6","first-page":"141","volume":"109","author":"JP Georges","year":"1995","unstructured":"Georges JP, Mauro DW (1995) Generalized vertex labelings with a condition at distance two. Congr Numer 109:141\u2013159","journal-title":"Congr Numer"},{"key":"9610_CR7","first-page":"141","volume":"140","author":"JP Georges","year":"1999","unstructured":"Georges JP, Mauro DW (1999) Some results on $$\\lambda _k^j$$ -numbers of the products of complete graphs. Congr Numer 140:141\u2013160","journal-title":"Congr Numer"},{"key":"9610_CR8","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1016\/0012-365X(93)E0098-O","volume":"135","author":"JP Georges","year":"1994","unstructured":"Georges JP, Mauro DW, Whittlesey MA (1994) Relating path coverings to vertex labellings with a condition at distance two. Discret Math 135:103\u2013111","journal-title":"Discret Math"},{"key":"9610_CR9","doi-asserted-by":"crossref","first-page":"28","DOI":"10.1137\/S0895480199351859","volume":"14","author":"JP Georges","year":"2000","unstructured":"Georges JP, Mauro DW, Stein MI (2000) Labeling products of complete graphs with a condition at distance two. SIAM J Discret Math 14:28\u201335","journal-title":"SIAM J Discret Math"},{"key":"9610_CR10","doi-asserted-by":"crossref","first-page":"586","DOI":"10.1137\/0405048","volume":"5","author":"JR Griggs","year":"1992","unstructured":"Griggs JR, Yeh RK (1992) Labelling graphs with a condition at distance 2. SIAM J Discret Math 5:586\u2013595","journal-title":"SIAM J Discret Math"},{"key":"9610_CR11","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1016\/S0012-365X(99)90280-7","volume":"211","author":"Y Hong","year":"2000","unstructured":"Hong Y, Shu JL (2000) A sharp upper bound for the spectral radius of the Nordhaus\u2013Gaddum type. Discret Math 211:229\u2013232","journal-title":"Discret Math"},{"key":"9610_CR12","first-page":"81","volume":"55","author":"PK Jha","year":"2000","unstructured":"Jha PK, Narayanan A, Sood P, Sundaram K, Sunder V (2000) On $$L(2,1)$$ -labelling of the Cartesian product of a cycle and a path. Ars Comb 55:81\u201389","journal-title":"Ars Comb"},{"issue":"4","key":"9610_CR13","first-page":"297","volume":"17","author":"XL Li","year":"1996","unstructured":"Li XL (1996) The relations between the spectral radius of a graph and its complement. J North China Technol Inst 17(4):297\u2013299","journal-title":"J North China Technol Inst"},{"issue":"1","key":"9610_CR14","first-page":"22","volume":"4","author":"DM L\u00fc","year":"2005","unstructured":"L\u00fc DM, L\u00fc JJ (2005) A lower bound and an upper bound for the algebraic connectivity of Nordhaus\u2013Gaddum type for similarity double-stars. J Nantong Univ (Nat Sci) 4(1):22","journal-title":"J Nantong Univ (Nat Sci)"},{"issue":"4","key":"9610_CR15","first-page":"368","volume":"33","author":"DM L\u00fc","year":"2006","unstructured":"L\u00fc DM, L\u00fc JJ (2006) A bound for the algebraic connectivity of Nordhaus\u2013Gaddum type for unicyclic graphs. J Zhejiang Univ (Sci Ed) 33(4):368\u2013371","journal-title":"J Zhejiang Univ (Sci Ed)"},{"key":"9610_CR16","first-page":"555","volume":"45","author":"D L\u00fc","year":"2007","unstructured":"L\u00fc D, Lin W, Song Z (2007) On $$L(2,1)$$ -labelings of graphs with conectiving number $$k$$ . J Jilin Univ (Sci Ed) 45:555\u2013561","journal-title":"J Jilin Univ (Sci Ed)"},{"key":"9610_CR17","doi-asserted-by":"crossref","first-page":"175","DOI":"10.2307\/2306658","volume":"63","author":"EA Nordhaus","year":"1956","unstructured":"Nordhaus EA, Gaddum JW (1956) On complementary graphs. Am Math Mon 63:175\u2013177","journal-title":"Am Math Mon"},{"key":"9610_CR18","unstructured":"Nosal E (1970) Eigenvalues of graphs. Masters\u2019s Thesis, University of Calgary, Calgary"},{"key":"9610_CR19","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1137\/S0895480191223178","volume":"7","author":"D Sakai","year":"1994","unstructured":"Sakai D (1994) Labelling chordal graphs: distance two condition. SIAM J Discret Math 7:133\u2013140","journal-title":"SIAM J Discret Math"},{"key":"9610_CR20","unstructured":"Shu JL, Hong Y (2000) New upper bounds on sum of the spectral radius of a graph and its complement. J East China Norm Univ (Nat Sci) 6:13\u201317"},{"key":"9610_CR21","doi-asserted-by":"crossref","first-page":"499","DOI":"10.1137\/S0895480192242821","volume":"8","author":"MA Whittlesey","year":"1995","unstructured":"Whittlesey MA, Georges JP, Mauro DW (1995) On the $$\\lambda $$ -number of $$Q_n$$ and related graphs. SIAM J Discret Math 8:499\u2013506","journal-title":"SIAM J Discret Math"},{"key":"9610_CR22","first-page":"15","volume":"1391","author":"B Zhou","year":"1997","unstructured":"Zhou B (1997) A note about the relations between the spectral radius of a graph and its complement. Pure Appl Math 1391:15\u201318","journal-title":"Pure Appl Math"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-013-9610-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-013-9610-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-013-9610-3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T04:23:20Z","timestamp":1559276600000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-013-9610-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,4,4]]},"references-count":22,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2015,2]]}},"alternative-id":["9610"],"URL":"https:\/\/doi.org\/10.1007\/s10878-013-9610-3","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,4,4]]}}}