{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,30]],"date-time":"2025-10-30T06:21:55Z","timestamp":1761805315094},"reference-count":10,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2014,12,4]],"date-time":"2014-12-04T00:00:00Z","timestamp":1417651200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Graphs and Combinatorics"],"published-print":{"date-parts":[[2015,11]]},"DOI":"10.1007\/s00373-014-1492-3","type":"journal-article","created":{"date-parts":[[2014,12,3]],"date-time":"2014-12-03T06:42:12Z","timestamp":1417588932000},"page":"2037-2042","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["An Intermediate Value Theorem for the Decycling Numbers of Toeplitz Graphs"],"prefix":"10.1007","volume":"31","author":[{"given":"Sheng","family":"Bau","sequence":"first","affiliation":[]},{"given":"Benjamin","family":"van Niekerk","sequence":"additional","affiliation":[]},{"given":"David","family":"White","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2014,12,4]]},"reference":[{"key":"1492_CR1","first-page":"54","volume":"15","author":"S Bau","year":"2011","unstructured":"Bau, S.: A generalization of the concept of Toeplitz graphs. Mong. Math. J. 15, 54\u201361 (2011)","journal-title":"Mong. Math. J."},{"key":"1492_CR2","first-page":"285","volume":"25","author":"S Bau","year":"2002","unstructured":"Bau, S., Beineke, L.W.: The decycling number of graphs. Austral. J. Combin. 25, 285\u2013298 (2002)","journal-title":"Austral. J. Combin."},{"key":"1492_CR3","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1002\/(SICI)1097-0118(199705)25:1<59::AID-JGT4>3.0.CO;2-H","volume":"25","author":"LW Beineke","year":"1996","unstructured":"Beineke, L.W., Vandell, R.C.: Decycling graphs. J. Gr. Theory 25, 59\u201377 (1996)","journal-title":"J. Gr. Theory"},{"key":"1492_CR4","unstructured":"Gray, R.M.: Toeplitz and circulant matrices: a review, http:\/\/ee.stanford.edu\/~gray\/toeplitz.pdf . Accessed 25 Nov 2014"},{"key":"1492_CR5","doi-asserted-by":"crossref","first-page":"412","DOI":"10.1109\/TIT.1970.1054470","volume":"IT\u201316","author":"RM Gray","year":"1970","unstructured":"Gray, R.M.: On the eigenvalue distribution of Toeplitz graphs. IEEE Trans. Inf. Theory IT\u201316, 412\u2013421 (1970)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"1492_CR6","volume-title":"A Hilbert Space Problem Book","author":"P Halmos","year":"1967","unstructured":"Halmos, P.: A Hilbert Space Problem Book. American Book Company, USA (1967)"},{"key":"1492_CR7","doi-asserted-by":"crossref","first-page":"2095","DOI":"10.1155\/IJMMS.2005.2095","volume":"13","author":"N Punnim","year":"2005","unstructured":"Punnim, N.: Switchings, realizations, and interpolation theorems for graph parameters. Int. J. Math. Math. Sci. 13, 2095\u20132117 (2005)","journal-title":"Int. J. Math. Math. Sci."},{"key":"1492_CR8","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1016\/0012-365X(95)00111-9","volume":"159","author":"R Dal van","year":"1996","unstructured":"van Dal, R., Tijssen, G., Tuza, Z., van der Veen, A.A., Zamfirescu, Ch., Zamfirescu, T.: Hamiltonian properties of Toeplitz graphs. Discret. Math. 159, 69\u201381 (1996)","journal-title":"Discret. Math."},{"key":"1492_CR9","first-page":"407","volume":"106","author":"B Zelinka","year":"1981","unstructured":"Zelinka, B.: Graphs of semigroups. Cas. Pest. Mat. 106, 407\u2013408 (1981)","journal-title":"Cas. Pest. Mat."},{"key":"1492_CR10","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1016\/S0012-365X(97)00173-8","volume":"185","author":"S-M Zhou","year":"1998","unstructured":"Zhou, S.-M.: Interpolation theorems for graphs, hypergraphs and matroids. Discret. Math. 185, 221\u2013229 (1998)","journal-title":"Discret. Math."}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-014-1492-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00373-014-1492-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-014-1492-3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,28]],"date-time":"2019-05-28T10:59:38Z","timestamp":1559041178000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00373-014-1492-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,12,4]]},"references-count":10,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2015,11]]}},"alternative-id":["1492"],"URL":"https:\/\/doi.org\/10.1007\/s00373-014-1492-3","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"value":"0911-0119","type":"print"},{"value":"1435-5914","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,12,4]]}}}