{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,11]],"date-time":"2026-03-11T17:18:00Z","timestamp":1773249480370,"version":"3.50.1"},"reference-count":14,"publisher":"Cambridge University Press (CUP)","issue":"1","license":[{"start":{"date-parts":[[2012,7,18]],"date-time":"2012-07-18T00:00:00Z","timestamp":1342569600000},"content-version":"unspecified","delay-in-days":0,"URL":"https:\/\/www.cambridge.org\/core\/terms"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Combinator. Probab. Comp."],"published-print":{"date-parts":[[2013,1]]},"abstract":"<jats:p>One can define the independence polynomial of a graph <jats:italic>G<\/jats:italic> as follows. Let <jats:italic>i<jats:sub>k<\/jats:sub>(G)<\/jats:italic> denote the number of independent sets of size <jats:italic>k<\/jats:italic> of <jats:italic>G<\/jats:italic>, where <jats:italic>i<jats:sub>0<\/jats:sub>(G)<\/jats:italic>=1. Then the independence polynomial of <jats:italic>G<\/jats:italic> is <jats:italic>I(G,x)<\/jats:italic>=\u2211<jats:sub><jats:italic>k<\/jats:italic>=0<\/jats:sub><jats:sup><jats:italic>n<\/jats:italic><\/jats:sup>(\u22121)<jats:sup><jats:italic>k<\/jats:italic><\/jats:sup><jats:italic>i<\/jats:italic><jats:sub><jats:italic>k<\/jats:italic><\/jats:sub><jats:italic>(G)x<jats:sup>k<\/jats:sup><\/jats:italic>. In this paper we give a new proof of the fact that the root of <jats:italic>I(G,x)<\/jats:italic> having the smallest modulus is unique and is real.<\/jats:p>","DOI":"10.1017\/s0963548312000302","type":"journal-article","created":{"date-parts":[[2012,7,18]],"date-time":"2012-07-18T10:03:00Z","timestamp":1342605780000},"page":"1-8","source":"Crossref","is-referenced-by-count":15,"title":["Note on the Smallest Root of the Independence Polynomial"],"prefix":"10.1017","volume":"22","author":[{"given":"P\u00c9TER","family":"CSIKV\u00c1RI","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"56","published-online":{"date-parts":[[2012,7,18]]},"reference":[{"key":"S0963548312000302_ref2","doi-asserted-by":"publisher","DOI":"10.1080\/00029890.1989.11972249"},{"key":"S0963548312000302_ref6","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511801655"},{"key":"S0963548312000302_ref5","doi-asserted-by":"publisher","DOI":"10.1016\/0012-365X(90)90202-S"},{"key":"S0963548312000302_ref7","doi-asserted-by":"publisher","DOI":"10.1016\/S0020-0190(00)00086-7"},{"key":"S0963548312000302_ref3","doi-asserted-by":"publisher","DOI":"10.1002\/jgt.3190130411"},{"key":"S0963548312000302_ref11","doi-asserted-by":"publisher","DOI":"10.1017\/S0963548308009085"},{"key":"S0963548312000302_ref12","unstructured":"Reiher C. The clique density theorem. Preprint."},{"key":"S0963548312000302_ref13","doi-asserted-by":"publisher","DOI":"10.1007\/s10955-004-2055-4"},{"key":"S0963548312000302_ref14","doi-asserted-by":"publisher","DOI":"10.1017\/S0963548305007182"},{"key":"S0963548312000302_ref9","first-page":"233","volume-title":"Proc. 1st International Conference on Algebraic Informatics: Thessaloniki 2005","author":"Levit","year":"2005"},{"key":"S0963548312000302_ref8","first-page":"313","article-title":"On clique polynomials","volume":"18","author":"Hajiabolhassan","year":"1998","journal-title":"Austral. J. Combin."},{"key":"S0963548312000302_ref10","doi-asserted-by":"publisher","DOI":"10.1090\/S0002-9947-2010-05189-X"},{"key":"S0963548312000302_ref1","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0079468"},{"key":"S0963548312000302_ref4","doi-asserted-by":"publisher","DOI":"10.1016\/0012-365X(92)90718-U"}],"container-title":["Combinatorics, Probability and Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.cambridge.org\/core\/services\/aop-cambridge-core\/content\/view\/S0963548312000302","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,24]],"date-time":"2019-04-24T20:06:16Z","timestamp":1556136376000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.cambridge.org\/core\/product\/identifier\/S0963548312000302\/type\/journal_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,7,18]]},"references-count":14,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2013,1]]}},"alternative-id":["S0963548312000302"],"URL":"https:\/\/doi.org\/10.1017\/s0963548312000302","relation":{},"ISSN":["0963-5483","1469-2163"],"issn-type":[{"value":"0963-5483","type":"print"},{"value":"1469-2163","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,7,18]]}}}