{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,31]],"date-time":"2026-03-31T23:48:59Z","timestamp":1775000939760,"version":"3.50.1"},"reference-count":30,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2011,11,1]],"date-time":"2011-11-01T00:00:00Z","timestamp":1320105600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Graphs and Combinatorics"],"published-print":{"date-parts":[[2013,3]]},"DOI":"10.1007\/s00373-011-1101-7","type":"journal-article","created":{"date-parts":[[2011,11,2]],"date-time":"2011-11-02T15:33:24Z","timestamp":1320248004000},"page":"259-273","source":"Crossref","is-referenced-by-count":4,"title":["The Cyclomatic Number of a Graph and its Independence Polynomial at \u22121"],"prefix":"10.1007","volume":"29","author":[{"given":"Vadim E.","family":"Levit","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Eugen","family":"Mandrescu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2011,11,1]]},"reference":[{"key":"1101_CR1","first-page":"15","volume":"58","author":"Y. Alavi","year":"1987","unstructured":"Alavi Y., Malde P.J., Schwenk A.J., Erd\u00f6s P.: The vertex independence sequence of a graph is not constrained. Congressus Numerantium 58, 15\u201323 (1987)","journal-title":"Congressus Numerantium"},{"key":"1101_CR2","first-page":"103","volume":"V","author":"J.L. Arocha","year":"1984","unstructured":"Arocha J.L.: Propriedades del polinomio independiente de un grafo. Revista Ciencias Matematicas V, 103\u2013110 (1984)","journal-title":"Revista Ciencias Matematicas"},{"key":"1101_CR3","doi-asserted-by":"crossref","first-page":"761","DOI":"10.1006\/eujc.2002.0602","volume":"23","author":"P.N. Balister","year":"2002","unstructured":"Balister P.N., Bollob\u00e1s B., Cutler J., Pebody L.: The interlace polynomial of graphs at \u22121. Eur. J. Comb. 23, 761\u2013767 (2002)","journal-title":"Eur. J. Comb."},{"key":"1101_CR4","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":"L.W. Beineke","year":"1997","unstructured":"Beineke L.W., Vandell R.C.: Decycling graphs. J. Graph Theory 25, 59\u201377 (1997)","journal-title":"J. Graph Theory"},{"key":"1101_CR5","doi-asserted-by":"crossref","first-page":"423","DOI":"10.1007\/s10801-007-0096-x","volume":"27","author":"M. Bousquet- M\u00e9lou","year":"2008","unstructured":"Bousquet- MM\u00e9lou M., Linusson S., Nevo E.: On the independence complex of square grids. J. Algebraic Comb. 27, 423\u2013450 (2008)","journal-title":"J. Algebraic Comb."},{"key":"1101_CR6","doi-asserted-by":"crossref","first-page":"197","DOI":"10.1023\/A:1008705614290","volume":"11","author":"J.I. Brown","year":"2000","unstructured":"Brown J.I., Dilcher K., Nowakowski R.J.: Roots of independence polynomials of well-covered graphs. J. Algebraic Comb. 11, 197\u2013210 (2000)","journal-title":"J. Algebraic Comb."},{"key":"1101_CR7","unstructured":"Campbell, S.R.: Some results on cubic well-covered graphs, Ph. D. thesis, 1987, Vanderbilt University. Department of Mathematics (1987)"},{"key":"1101_CR8","doi-asserted-by":"crossref","unstructured":"Dochtermann, A., Engstr\u00f6m, A.: Algebraic properties of edge ideals via combinatorial topology. Electron. J. Comb. 16(2), #R2 (2009)","DOI":"10.37236\/68"},{"key":"1101_CR9","doi-asserted-by":"crossref","first-page":"234","DOI":"10.1016\/j.ejc.2006.09.007","volume":"29","author":"A. Engstr\u00f6m","year":"2008","unstructured":"Engstr\u00f6m A.: Independence complexes of claw-free graphs. Eur. J. Comb. 29, 234\u2013241 (2008)","journal-title":"Eur. J. Comb."},{"key":"1101_CR10","doi-asserted-by":"crossref","first-page":"429","DOI":"10.1016\/j.ejc.2008.05.004","volume":"30","author":"A. Engstr\u00f6m","year":"2009","unstructured":"Engstr\u00f6m A.: Upper bounds on the Witten index for supersymmetric laticce models by discrete Morse theory. Eur. J. Comb. 30, 429\u2013438 (2009)","journal-title":"Eur. J. Comb."},{"key":"1101_CR11","doi-asserted-by":"crossref","first-page":"3299","DOI":"10.1016\/j.disc.2008.09.033","volume":"309","author":"A. Engstr\u00f6m","year":"2009","unstructured":"Engstr\u00f6m A.: Complexes of directed trees and independence complexes. Discret. Math. 309, 3299\u20133309 (2009)","journal-title":"Discret. Math."},{"key":"1101_CR12","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1016\/0012-365X(82)90215-1","volume":"42","author":"O. Favaron","year":"1982","unstructured":"Favaron O.: Very well-covered graphs. Discret. Math. 42, 177\u2013187 (1982)","journal-title":"Discret. Math."},{"key":"1101_CR13","doi-asserted-by":"crossref","first-page":"44","DOI":"10.1006\/jctb.1993.1005","volume":"57","author":"A. Finbow","year":"1993","unstructured":"Finbow A., Hartnell B., Nowakowski R.J.: A characterization of well-covered graphs of girth 5 or greater. J. Comb. Theory B 57, 44\u201368 (1993)","journal-title":"J. Comb. Theory B"},{"key":"1101_CR14","first-page":"97","volume":"24","author":"I. Gutman","year":"1983","unstructured":"Gutman I., Harary F.: Generalizations of the matching polynomial. Utilitas Mathematica 24, 97\u2013106 (1983)","journal-title":"Utilitas Mathematica"},{"key":"1101_CR15","doi-asserted-by":"crossref","unstructured":"Harary, F.: Graph Theory. Parseus Books (1969)","DOI":"10.21236\/AD0705364"},{"key":"1101_CR16","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1016\/0012-365X(94)90163-5","volume":"125","author":"C. Hoede","year":"1994","unstructured":"Hoede C., Li X.: Clique polynomials and independent set polynomials of graphs. Discret. Math. 125, 219\u2013228 (1994)","journal-title":"Discret. Math."},{"key":"1101_CR17","doi-asserted-by":"crossref","unstructured":"Jonsson, J.: Simplicial complexes of graphs. Lecture Notes in Mathematics, vol. 1928. Springer, Berlin (2008)","DOI":"10.1007\/978-3-540-75859-4"},{"key":"1101_CR18","doi-asserted-by":"crossref","unstructured":"Karp, R.: Reducibility among combinatorial problems. In: Miller, R.E., Thatcher, J.W. (eds.) Complexity of Computer Computations, Plenum Press, New York, pp. 85\u2013103 (1972)","DOI":"10.1007\/978-1-4684-2001-2_9"},{"key":"1101_CR19","doi-asserted-by":"crossref","first-page":"1175","DOI":"10.1016\/j.dam.2006.10.010","volume":"155","author":"A. Knopfmachera","year":"2007","unstructured":"Knopfmachera A., Tichy R.F., Wagner S., Ziegler V.: Graphs, partitions and Fibonacci numbers. Discret. Appl. Math. 155, 1175\u20131187 (2007)","journal-title":"Discret. Appl. Math."},{"key":"1101_CR20","doi-asserted-by":"crossref","unstructured":"Levit, V.E., Mandrescu, E.: On unimodality of independence polynomials of some well-covered trees, Discrete Mathematics and Theoretical Computer Science. Lecture Notes in Computer Science, vol. 2731. Springer, Berlin, pp. 237\u2013256 (2003)","DOI":"10.1007\/3-540-45066-1_19"},{"key":"1101_CR21","unstructured":"Levit, V.E., Mandrescu, E.: The independence polynomial of a graph\u2014a survey. In: Proceedings of the 1st International Conference on Algebraic Informatics, Aristotle University of Thessaloniki, Greece, 20\u201323 October, pp. 233\u2013254 (2005)"},{"key":"1101_CR22","doi-asserted-by":"crossref","first-page":"931","DOI":"10.1016\/j.ejc.2005.04.007","volume":"27","author":"V.E. Levit","year":"2006","unstructured":"Levit V.E., Mandrescu E.: Independence polynomials of well-covered graphs: generic counterexamples for the unimodality conjecture. Eur. J. Comb. 27, 931\u2013939 (2006)","journal-title":"Eur. J. Comb."},{"key":"1101_CR23","first-page":"109","volume":"179","author":"V.E. Levit","year":"2006","unstructured":"Levit V.E., Mandrescu E.: Partial unimodality for independence polynomials of K\u00f6nig\u2013Egerv\u00e1ry graphs. Congressus Numerantium 179, 109\u2013119 (2006)","journal-title":"Congressus Numerantium"},{"key":"1101_CR24","first-page":"97","volume":"186","author":"V.E. Levit","year":"2007","unstructured":"Levit V.E., Mandrescu E.: Some structural properties of very well-covered graphs. Congressus Numerantium 186, 97\u2013106 (2007)","journal-title":"Congressus Numerantium"},{"key":"1101_CR25","doi-asserted-by":"crossref","first-page":"478","DOI":"10.1016\/j.dam.2006.06.016","volume":"156","author":"V.E. Levit","year":"2008","unstructured":"Levit V.E., Mandrescu E.: On the roots of independence polynomials of almost all very well-covered graphs. Discret. Appl. Math. 156, 478\u2013491 (2008)","journal-title":"Discret. Appl. Math."},{"key":"1101_CR26","unstructured":"Levit, V.E., Mandrescu, E.: A simple proof of an inequality connecting the alternating number of independent sets and the decycling number. Discret. Math. 311, 1204\u20131206 (2011)"},{"key":"1101_CR27","doi-asserted-by":"crossref","first-page":"246","DOI":"10.1016\/j.dam.2005.04.002","volume":"152","author":"A.S. Pedersen","year":"2005","unstructured":"Pedersen A.S., Vestergaard P.D.: The number of independent sets in unicyclic graphs. Discret. Appl. Math. 152, 246\u2013256 (2005)","journal-title":"Discret. Appl. Math."},{"key":"1101_CR28","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1016\/S0021-9800(70)80011-4","volume":"8","author":"M.D. Plummer","year":"1970","unstructured":"Plummer M.D.: Some covering concepts in graphs. J. Comb. Theory 8, 91\u201398 (1970)","journal-title":"J. Comb. Theory"},{"key":"1101_CR29","doi-asserted-by":"crossref","first-page":"16","DOI":"10.1080\/00150517.1982.12430021","volume":"20","author":"H. Prodinger","year":"1982","unstructured":"Prodinger H., Tichy R.F.: Fibonacci numbers of graphs. Fibonacci Q. 20, 16\u201321 (1982)","journal-title":"Fibonacci Q."},{"key":"1101_CR30","doi-asserted-by":"crossref","first-page":"355","DOI":"10.1016\/0012-365X(88)90226-9","volume":"72","author":"S. Ueno","year":"1988","unstructured":"Ueno S., Kajitani Y., Gotoh S.: On the nonseparating independent set problem and feedback set problem for graphs with no vertex degree exceeding three. Discret. Math. 72, 355\u2013360 (1988)","journal-title":"Discret. Math."}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-011-1101-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00373-011-1101-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-011-1101-7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,13]],"date-time":"2025-03-13T18:05:05Z","timestamp":1741889105000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00373-011-1101-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,11,1]]},"references-count":30,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2013,3]]}},"alternative-id":["1101"],"URL":"https:\/\/doi.org\/10.1007\/s00373-011-1101-7","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"value":"0911-0119","type":"print"},{"value":"1435-5914","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,11,1]]}}}