{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,11]],"date-time":"2026-02-11T13:34:25Z","timestamp":1770816865837,"version":"3.50.1"},"reference-count":27,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2017,8,28]],"date-time":"2017-08-28T00:00:00Z","timestamp":1503878400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100003593","name":"CNPq","doi-asserted-by":"crossref","award":["400122\/2014-6,"],"award-info":[{"award-number":["400122\/2014-6,"]}],"id":[{"id":"10.13039\/501100003593","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100003593","name":"CNPq","doi-asserted-by":"crossref","award":["400122\/2014-6,"],"award-info":[{"award-number":["400122\/2014-6,"]}],"id":[{"id":"10.13039\/501100003593","id-type":"DOI","asserted-by":"crossref"}]},{"name":"FCT- Funda\u00e7\u00e3o para a Ci\u00eancia e a Tecnologia","award":["ID\/MAT\/04106\/2013"],"award-info":[{"award-number":["ID\/MAT\/04106\/2013"]}]},{"DOI":"10.13039\/501100003593","name":"CNPq","doi-asserted-by":"crossref","award":["409746\/2016-9"],"award-info":[{"award-number":["409746\/2016-9"]}],"id":[{"id":"10.13039\/501100003593","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100003593","name":"CNPq","doi-asserted-by":"crossref","award":["303334\/2016-9"],"award-info":[{"award-number":["303334\/2016-9"]}],"id":[{"id":"10.13039\/501100003593","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Graphs and Combinatorics"],"published-print":{"date-parts":[[2017,9]]},"DOI":"10.1007\/s00373-017-1844-x","type":"journal-article","created":{"date-parts":[[2017,8,28]],"date-time":"2017-08-28T13:49:31Z","timestamp":1503928171000},"page":"1283-1295","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":14,"title":["Laplacian Distribution and Domination"],"prefix":"10.1007","volume":"33","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-6239-3557","authenticated-orcid":false,"given":"Domingos M.","family":"Cardoso","sequence":"first","affiliation":[]},{"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":"297","published-online":{"date-parts":[[2017,8,28]]},"reference":[{"key":"1844_CR1","first-page":"399","volume-title":"Approximation Algorithms for NP-Hard Problems","author":"S Arora","year":"1997","unstructured":"Arora, S., Lund, C.: Hardness of approximations. In: Hochbaum, D.S. (ed.) Approximation Algorithms for NP-Hard Problems, pp. 399\u2013446. PWS Publishing Company, Boston (1997)"},{"key":"1844_CR2","unstructured":"Berge, C.: Graphs and Hypergraphs. North-Holland Publishing Co., Amsterdam, American Elsevier Publishing Co., Inc., New York, 1973, Translated from the French by Edward Minieka, North-Holland Mathematical Library, Vol. 6 (1973)"},{"issue":"9","key":"1844_CR3","first-page":"6","volume":"10","author":"T B\u00f6hme","year":"2003","unstructured":"B\u00f6hme, T., Mohar, B.: Domination, packing and excluded minors. Electron. J. Combin. 10(9), 6 (2003). (electronic)","journal-title":"Electron. J. Combin."},{"issue":"3","key":"1844_CR4","doi-asserted-by":"crossref","first-page":"241","DOI":"10.1002\/jgt.3190030306","volume":"3","author":"B Bollob\u00e1s","year":"1979","unstructured":"Bollob\u00e1s, B., Cockayne, E.J.: Graph-theoretic parameters concerning domination, independence, and irredundance. J. Graph Theory 3(3), 241\u2013249 (1979)","journal-title":"J. Graph Theory"},{"issue":"21","key":"1844_CR5","doi-asserted-by":"crossref","first-page":"2382","DOI":"10.1016\/j.disc.2013.06.017","volume":"313","author":"RO Braga","year":"2013","unstructured":"Braga, R.O., Rodrigues, V.M., Trevisan, V.: On the distribution of Laplacian eigenvalues of trees. Discr. Math. 313(21), 2382\u20132389 (2013)","journal-title":"Discr. Math."},{"issue":"1","key":"1844_CR6","first-page":"33","volume":"46","author":"C Brand","year":"1996","unstructured":"Brand, C., Seifter, N.: Eigenvalues and domination in graphs. Math. Slov. 46(1), 33\u201339 (1996)","journal-title":"Math. Slov."},{"issue":"1","key":"1844_CR7","doi-asserted-by":"crossref","first-page":"46","DOI":"10.1002\/jgt.20565","volume":"69","author":"B Bre\u0161ar","year":"2012","unstructured":"Bre\u0161ar, B., Dorbec, P., Goddard, W., Hartnell, B.L., Henning, M.A., Klav\u017ear, S., Rall, D.F.: Vizing\u2019s conjecture: a survey and recent results. J. Graph Theory 69(1), 46\u201376 (2012)","journal-title":"J. Graph Theory"},{"key":"1844_CR8","unstructured":"Chappell, G.G., Gimbel, J., Hartman, C.: Approximations of the domination number of a graph, preprint (2005)"},{"issue":"1","key":"1844_CR9","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1016\/0020-0190(75)90011-3","volume":"4","author":"EJ Cockayne","year":"1975","unstructured":"Cockayne, E.J., Goodman, S., Hedetniemi, S.T.: A linear time algorithm for the domination number of a tree. Inf. Proc. Lett. 4(1), 41\u201344 (1975)","journal-title":"Inf. Proc. Lett."},{"key":"1844_CR10","doi-asserted-by":"crossref","first-page":"247","DOI":"10.1002\/net.3230070305","volume":"7","author":"EJ Cockayne","year":"1977","unstructured":"Cockayne, E.J., Hedetniemi, S.T.: Toward a theory of domination in graphs. Networks 7, 247\u2013261 (1977)","journal-title":"Networks"},{"issue":"1","key":"1844_CR11","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1016\/0012-365X(91)90403-O","volume":"89","author":"P Damaschke","year":"1991","unstructured":"Damaschke, P.: Irredundance number versus domination number. Discr. Math. 89(1), 101\u2013104 (1991)","journal-title":"Discr. Math."},{"key":"1844_CR12","doi-asserted-by":"crossref","unstructured":"Domke, G.S., Dunbar, J.E., Markus, L.R.: Gallai-type theorems and domination parameters. Discr. Math. 167\/168, 237\u2013248 (1997), 15th British Combinatorial Conference (Stirling, 1995)","DOI":"10.1016\/S0012-365X(97)00231-8"},{"key":"1844_CR13","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability. W. H. Freeman and Co., San Francisco, CA (1979) A guide to the theory of NP-completeness, A Series of Books in the Mathematical Sciences"},{"key":"1844_CR14","unstructured":"Grinstead, D.L., Slater, P.J.: Fractional domination and fractional packing in graphs. In: Proceedings of the 20th Southeastern Conference on Combinatorics, Graph Theory, and Computing (Boca Raton, FL, 1989), vol.\u00a071, pp.\u00a0153\u2013172 (1990)"},{"issue":"2","key":"1844_CR15","doi-asserted-by":"crossref","first-page":"218","DOI":"10.1137\/0611016","volume":"11","author":"R Grone","year":"1990","unstructured":"Grone, R., Merris, R., Sunder, V.S.: The Laplacian spectrum of a graph. SIAM J. Matrix Anal. Appl. 11(2), 218\u2013238 (1990)","journal-title":"SIAM J. Matrix Anal. Appl."},{"key":"1844_CR16","first-page":"113","volume":"68","author":"FJ Hall","year":"2009","unstructured":"Hall, F.J., Patel, K., Stewart, M.: Interlacing results on matrices associated with graphs. J. Combin. Math. Combin. Comput. 68, 113\u2013127 (2009)","journal-title":"J. Combin. Math. Combin. Comput."},{"key":"1844_CR17","series-title":"Monographs and Textbooks in Pure and Applied Mathematics","volume-title":"Fundamentals of Domination in Graphs","author":"TW Haynes","year":"1998","unstructured":"Haynes, T.W., Hedetniemi, S.T., Slater, P.J.: Fundamentals of Domination in Graphs. Monographs and Textbooks in Pure and Applied Mathematics, vol. 208. Marcel Dekker Inc, New York (1998)"},{"key":"1844_CR18","doi-asserted-by":"crossref","first-page":"66","DOI":"10.1016\/j.ejc.2015.11.005","volume":"53","author":"ST Hedetniemi","year":"2016","unstructured":"Hedetniemi, S.T., Jacobs, D.P., Trevisan, V.: Domination number and Laplacian eigenvalue distribution. Eur. J. Combin. 53, 66\u201371 (2016)","journal-title":"Eur. J. Combin."},{"key":"1844_CR19","first-page":"A728","volume":"274","author":"F Jaeger","year":"1972","unstructured":"Jaeger, F., Payan, C.: Relations du type Nordhaus-Gaddum pour le nombre d\u2019absorption d\u2019un graphe simple. C. R. Acad. Sci. Paris S\u00e9r. A B 274, A728\u2013A730 (1972)","journal-title":"C. R. Acad. Sci. Paris S\u00e9r. A B"},{"issue":"5","key":"1844_CR20","doi-asserted-by":"crossref","first-page":"960","DOI":"10.1145\/185675.306789","volume":"41","author":"C Lund","year":"1994","unstructured":"Lund, C., Yannakakis, M.: On the hardness of approximating minimization problems. J. Assoc. Comput. Mach. 41(5), 960\u2013981 (1994)","journal-title":"J. Assoc. Comput. Mach."},{"issue":"1\u20133","key":"1844_CR21","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1016\/S0024-3795(00)00333-5","volume":"325","author":"GJ Ming","year":"2001","unstructured":"Ming, G.J., Wang, T.S.: A relation between the matching number and Laplacian spectrum of a graph. Linear Algebra Appl. 325(1\u20133), 71\u201374 (2001)","journal-title":"Linear Algebra Appl."},{"key":"1844_CR22","unstructured":"Mohar, B.: The Laplacian spectrum of graphs, Graph theory, combinatorics, and applications. Vol. 2 (Kalamazoo, MI, 1988), Wiley-Intersci. Publ., Wiley, New York, pp.\u00a0871\u2013898 (1991)"},{"key":"1844_CR23","doi-asserted-by":"crossref","unstructured":"Mohar, B.: Laplace eigenvalues of graphs\u2014a survey. Discr. Math. 109(1-3), 171\u2013183 (1992). Algebraic graph theory (Leibnitz, 1989)","DOI":"10.1016\/0012-365X(92)90288-Q"},{"key":"1844_CR24","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1093\/imamat\/14.2.183","volume":"14","author":"J Nieminen","year":"1974","unstructured":"Nieminen, J.: Two bounds for the domination number of a graph. J. Inst. Math. Appl. 14, 183\u2013187 (1974)","journal-title":"J. Inst. Math. Appl."},{"issue":"6(144)","key":"1844_CR25","first-page":"117","volume":"23","author":"VG Vizing","year":"1968","unstructured":"Vizing, V.G.: Some unsolved problems in graph theory. Uspehi Mat. Nauk 23(6(144)), 117\u2013134 (1968)","journal-title":"Uspehi Mat. Nauk"},{"issue":"4","key":"1844_CR26","doi-asserted-by":"crossref","first-page":"476","DOI":"10.1002\/mana.201300331","volume":"288","author":"R Xing","year":"2015","unstructured":"Xing, R., Zhou, B.: Laplacian and signless Laplacian spectral radii of graphs with fixed domination number. Math. Nachr. 288(4), 476\u2013480 (2015)","journal-title":"Math. Nachr."},{"issue":"1","key":"1844_CR27","doi-asserted-by":"crossref","first-page":"65","DOI":"10.11650\/tjm.19.2015.4411","volume":"19","author":"L Zhou","year":"2015","unstructured":"Zhou, L., Zhou, B., Zhibin, D.: On the number of Laplacian eigenvalues of trees smaller than two. Taiwan J. Math. 19(1), 65\u201375 (2015)","journal-title":"Taiwan J. Math."}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00373-017-1844-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-017-1844-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-017-1844-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,10,2]],"date-time":"2019-10-02T17:28:58Z","timestamp":1570037338000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00373-017-1844-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,8,28]]},"references-count":27,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2017,9]]}},"alternative-id":["1844"],"URL":"https:\/\/doi.org\/10.1007\/s00373-017-1844-x","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"value":"0911-0119","type":"print"},{"value":"1435-5914","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,8,28]]}}}