{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T02:59:15Z","timestamp":1740106755702,"version":"3.37.3"},"reference-count":26,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2016,4,1]],"date-time":"2016-04-01T00:00:00Z","timestamp":1459468800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2020,4,1]],"date-time":"2020-04-01T00:00:00Z","timestamp":1585699200000},"content-version":"vor","delay-in-days":1461,"URL":"http:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"funder":[{"DOI":"10.13039\/501100003593","name":"CNPq","doi-asserted-by":"publisher","award":["400122\/2014-6"],"id":[{"id":"10.13039\/501100003593","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["European Journal of Combinatorics"],"published-print":{"date-parts":[[2016,4]]},"DOI":"10.1016\/j.ejc.2015.11.005","type":"journal-article","created":{"date-parts":[[2015,12,7]],"date-time":"2015-12-07T05:37:05Z","timestamp":1449466625000},"page":"66-71","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":20,"special_numbering":"C","title":["Domination number and Laplacian eigenvalue distribution"],"prefix":"10.1016","volume":"53","author":[{"given":"Stephen T.","family":"Hedetniemi","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9409-0761","authenticated-orcid":false,"given":"David P.","family":"Jacobs","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7053-8530","authenticated-orcid":false,"given":"Vilmar","family":"Trevisan","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/j.ejc.2015.11.005_br000005","doi-asserted-by":"crossref","first-page":"2879","DOI":"10.1016\/j.laa.2009.12.031","article-title":"A sharp upper bound on algebraic connectivity using domination number","volume":"432","author":"Aouchiche","year":"2010","journal-title":"Linear Algebra Appl."},{"issue":"126","key":"10.1016\/j.ejc.2015.11.005_br000010","first-page":"3","article-title":"Estimation of the exterior stability number of a graph by means of the minimal degree of the vertices","volume":"11","author":"Arnautov","year":"1974","journal-title":"Prikl. Mat. Program. Vyp."},{"key":"10.1016\/j.ejc.2015.11.005_br000015","doi-asserted-by":"crossref","first-page":"241","DOI":"10.1002\/jgt.3190030306","article-title":"Graph theoretic parameters concerning domination, independence and irredundance","volume":"3","author":"Bollabas","year":"1979","journal-title":"J. Graph Theory"},{"key":"10.1016\/j.ejc.2015.11.005_br000020","doi-asserted-by":"crossref","first-page":"2382","DOI":"10.1016\/j.disc.2013.06.017","article-title":"On the distribution of Laplacian eigenvalues of trees","volume":"313","author":"Braga","year":"2013","journal-title":"Discrete Math."},{"key":"10.1016\/j.ejc.2015.11.005_br000025","first-page":"33","article-title":"Eigenvalues and domination in graphs","volume":"46","author":"Brand","year":"1996","journal-title":"Math. Slovaca"},{"year":"2012","series-title":"Spectra of Graphs","author":"Brouwer","key":"10.1016\/j.ejc.2015.11.005_br000030"},{"key":"10.1016\/j.ejc.2015.11.005_br000035","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1016\/S0012-365X(98)00237-4","article-title":"Vertex-disjoint claws in graphs","volume":"197\u2013198","author":"Egawa","year":"1999","journal-title":"Discrete Math."},{"key":"10.1016\/j.ejc.2015.11.005_br000040","doi-asserted-by":"crossref","first-page":"648","DOI":"10.1016\/j.laa.2006.06.008","article-title":"Minimizing the Laplacian eigenvalues for trees with given domination number","volume":"419","author":"Feng","year":"2006","journal-title":"Linear Algebra Appl."},{"year":"1979","series-title":"Computers and Intractability, A Guide to the Theory of NP-Completeness","author":"Garey","key":"10.1016\/j.ejc.2015.11.005_br000045"},{"key":"10.1016\/j.ejc.2015.11.005_br000050","doi-asserted-by":"crossref","first-page":"218","DOI":"10.1137\/0611016","article-title":"The Laplacian spectrum of a graph","volume":"11","author":"Grone","year":"1990","journal-title":"SIAM J. Matrix Anal. Appl."},{"key":"10.1016\/j.ejc.2015.11.005_br000055","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1002\/jgt.20198","article-title":"The kth Laplacian eigenvalue of a tree","volume":"54","author":"Guo","year":"2007","journal-title":"J. Graph Theory"},{"key":"10.1016\/j.ejc.2015.11.005_br000060","doi-asserted-by":"crossref","first-page":"2259","DOI":"10.1007\/s10114-011-8624-y","article-title":"On the distribution of Laplacian eigenvalues in a graph","volume":"27","author":"Guo","year":"2011","journal-title":"Acta Math. Sinica"},{"key":"10.1016\/j.ejc.2015.11.005_br000065","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1016\/j.laa.2014.02.025","article-title":"A note on Laplacian eigenvalues and domination","volume":"449","author":"Har","year":"2014","journal-title":"Linear Algebra Appl."},{"year":"1998","series-title":"Fundamentals of Domination in Graphs","author":"Haynes","key":"10.1016\/j.ejc.2015.11.005_br000070"},{"key":"10.1016\/j.ejc.2015.11.005_br000075","doi-asserted-by":"crossref","first-page":"749","DOI":"10.1002\/jgt.3190130610","article-title":"Domination in graphs with minimum degree two","volume":"13","author":"McCuaig","year":"1989","journal-title":"J. Graph Theory"},{"key":"10.1016\/j.ejc.2015.11.005_br000080","first-page":"345","article-title":"The number of eigenvalues greater than two in the Laplacian spectrum of a graph","volume":"48","author":"Merris","year":"1991","journal-title":"Port. Math."},{"key":"10.1016\/j.ejc.2015.11.005_br000085","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1016\/0024-3795(94)90486-3","article-title":"Laplacian matrices of graphs: A survey","volume":"197\u2013198","author":"Merris","year":"1994","journal-title":"Linear Algebra Appl."},{"issue":"1","key":"10.1016\/j.ejc.2015.11.005_br000090","article-title":"The lattice of threshold graphs","volume":"6","author":"Merris","year":"2005","journal-title":"J. Inequal. Pure Appl. Math."},{"key":"10.1016\/j.ejc.2015.11.005_br000095","series-title":"Graph Theory, Combinatorics, and Applications, Vol. 2","first-page":"871","article-title":"The Laplacian spectrum of graphs","author":"Mohar","year":"1991"},{"key":"10.1016\/j.ejc.2015.11.005_br000100","doi-asserted-by":"crossref","first-page":"171","DOI":"10.1016\/0012-365X(92)90288-Q","article-title":"Laplace eigenvalues of graphs\u2014a survey","volume":"109","author":"Mohar","year":"1992","journal-title":"Discrete Math."},{"key":"10.1016\/j.ejc.2015.11.005_br000105","doi-asserted-by":"crossref","first-page":"667","DOI":"10.1016\/j.laa.2006.08.020","article-title":"Bounds on graph eigenvalues I","volume":"420","author":"Nikiforov","year":"2007","journal-title":"Linear Algebra Appl."},{"year":"1962","series-title":"Theory of Graphs, Vol.38","author":"Ore","key":"10.1016\/j.ejc.2015.11.005_br000110"},{"key":"10.1016\/j.ejc.2015.11.005_br000115","first-page":"307","article-title":"Sur le nombre d\u2019absorption d\u2019un graphe simple","volume":"17","author":"Payan","year":"1975","journal-title":"Cah. Cent. Etud. Rech. Oper."},{"key":"10.1016\/j.ejc.2015.11.005_br000120","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1017\/S0963548300002042","article-title":"Paths, stars, and the number three","volume":"5","author":"Reed","year":"1996","journal-title":"Comb. Probab. Comput."},{"key":"10.1016\/j.ejc.2015.11.005_br000125","doi-asserted-by":"crossref","first-page":"476","DOI":"10.1002\/mana.201300331","article-title":"Laplacian and signless Laplacian spectral radii of graphs with fixed domination number","volume":"288","author":"Xing","year":"2015","journal-title":"Math. Nachr."},{"key":"10.1016\/j.ejc.2015.11.005_br000130","doi-asserted-by":"crossref","first-page":"65","DOI":"10.11650\/tjm.19.2015.4411","article-title":"On the number of Laplacian eigenvalues of trees smaller than two","volume":"19","author":"Zhou","year":"2015","journal-title":"Taiwanese J. Math."}],"container-title":["European Journal of Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0195669815002516?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0195669815002516?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,4,1]],"date-time":"2020-04-01T01:32:37Z","timestamp":1585704757000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0195669815002516"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,4]]},"references-count":26,"alternative-id":["S0195669815002516"],"URL":"https:\/\/doi.org\/10.1016\/j.ejc.2015.11.005","relation":{},"ISSN":["0195-6698"],"issn-type":[{"type":"print","value":"0195-6698"}],"subject":[],"published":{"date-parts":[[2016,4]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Domination number and Laplacian eigenvalue distribution","name":"articletitle","label":"Article Title"},{"value":"European Journal of Combinatorics","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.ejc.2015.11.005","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 2015 Elsevier Ltd. All rights reserved.","name":"copyright","label":"Copyright"}]}}