{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,6,21]],"date-time":"2024-06-21T14:55:59Z","timestamp":1718981759535},"reference-count":22,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2011,3,30]],"date-time":"2011-03-30T00:00:00Z","timestamp":1301443200000},"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":[[2012,3]]},"DOI":"10.1007\/s00373-011-1041-2","type":"journal-article","created":{"date-parts":[[2011,3,29]],"date-time":"2011-03-29T18:20:22Z","timestamp":1301422822000},"page":"167-187","source":"Crossref","is-referenced-by-count":3,"title":["Trees with Given Stability Number and Minimum Number of Stable Sets"],"prefix":"10.1007","volume":"28","author":[{"given":"V\u00e9ronique","family":"Bruy\u00e8re","sequence":"first","affiliation":[]},{"given":"Gwena\u00ebl","family":"Joret","sequence":"additional","affiliation":[]},{"given":"Hadrien","family":"M\u00e9lot","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2011,3,30]]},"reference":[{"issue":"3","key":"1041_CR1","first-page":"206","volume":"36","author":"A.F. Alameddine","year":"1998","unstructured":"Alameddine A.F.: Bounds on the Fibonacci number of a maximal outerplanar graph. Fibonacci Q. 36(3), 206\u2013210 (1998)","journal-title":"Fibonacci Q."},{"key":"1041_CR2","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1007\/s10878-009-9228-7","volume":"18","author":"V. Bruy\u00e8re","year":"2009","unstructured":"Bruy\u00e8re V., M\u00e9lot H.: Fibonacci index and stability number of graphs: a polyhedral study. J. Combin. Optim. 18, 207\u2013228 (2009)","journal-title":"J. Combin. Optim."},{"issue":"1","key":"1041_CR3","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1007\/s10910-006-9180-z","volume":"43","author":"H. Deng","year":"2008","unstructured":"Deng H., Chen S., Zhang J.: The Merrifield\u2013Simmons index in (n, n\u00a0+\u00a01)-graphs. J. Math. Chem. 43(1), 75\u201391 (2008)","journal-title":"J. Math. Chem."},{"key":"1041_CR4","volume-title":"Graph theory. Graduate Texts in Mathematics, vol. 173","author":"R. Diestel","year":"2005","unstructured":"Diestel R.: Graph theory. Graduate Texts in Mathematics, vol. 173, 3rd edn. Springer, Berlin (2005)","edition":"3"},{"key":"1041_CR5","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-70982-1","volume-title":"Mathematical Concepts in Organic Chemistry","author":"I. Gutman","year":"1986","unstructured":"Gutman I., Polansky O.E.: Mathematical Concepts in Organic Chemistry. Springer, Berlin (1986)"},{"key":"1041_CR6","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1002\/jgt.20294","volume":"58","author":"C. Heuberger","year":"2008","unstructured":"Heuberger C., Wagner S.: Maximizing the number of independent subsets over trees with bounded degree. J. Graph Theory 58, 49\u201368 (2008)","journal-title":"J. Graph Theory"},{"issue":"3","key":"1041_CR7","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1017\/S0963548301004631","volume":"10","author":"J. Kahn","year":"2001","unstructured":"Kahn J.: An entropy approach to the hard-core model on bipartite graphs. Combin. Probab. Comput. 10(3), 219\u2013237 (2001)","journal-title":"Combin. Probab. Comput."},{"key":"1041_CR8","doi-asserted-by":"crossref","first-page":"1175","DOI":"10.1016\/j.dam.2006.10.010","volume":"155","author":"A. Knopfmacher","year":"2007","unstructured":"Knopfmacher A., Tichy R.F., Wagner S., Ziegler V.: Graphs, partitions and Fibonacci numbers. Discrete Appl. Math. 155, 1175\u20131187 (2007)","journal-title":"Discrete Appl. Math."},{"issue":"13","key":"1041_CR9","doi-asserted-by":"crossref","first-page":"2877","DOI":"10.1016\/j.dam.2009.03.022","volume":"157","author":"S. Li","year":"2009","unstructured":"Li S., Li X., Jing W.: On the extremal Merrifield\u2013Simmons index and Hosoya index of quasi-tree graphs. Discrete Appl. Math. 157(13), 2877\u20132885 (2009)","journal-title":"Discrete Appl. Math."},{"issue":"7","key":"1041_CR10","doi-asserted-by":"crossref","first-page":"1387","DOI":"10.1016\/j.dam.2008.10.012","volume":"157","author":"S. Li","year":"2009","unstructured":"Li S., Zhu Z.: The number of independent sets in unicyclic graphs with a given diameter. Discrete Appl. Math. 157(7), 1387\u20131395 (2009)","journal-title":"Discrete Appl. Math."},{"key":"1041_CR11","first-page":"389","volume":"54","author":"X. Li","year":"2005","unstructured":"Li X., Zhao H., Gutman I.: On the Merrifield\u2013Simmons index of trees. MATCH Commun. Math. Comp. Chem. 54, 389\u2013402 (2005)","journal-title":"MATCH Commun. Math. Comp. Chem."},{"issue":"3","key":"1041_CR12","first-page":"199","volume":"23","author":"S.B. Lin","year":"1995","unstructured":"Lin S.B., Lin C.: Trees and forests with large and small independent indices. Chin. J. Math. 23(3), 199\u2013210 (1995)","journal-title":"Chin. J. Math."},{"key":"1041_CR13","doi-asserted-by":"crossref","first-page":"1875","DOI":"10.1016\/j.dam.2007.09.005","volume":"156","author":"H. M\u00e9lot","year":"2008","unstructured":"M\u00e9lot H.: Facet defining inequalities among graph invariants: the system GraPHedron. Discrete Appl. Math. 156, 1875\u20131891 (2008)","journal-title":"Discrete Appl. Math."},{"key":"1041_CR14","volume-title":"Topological Methods in Chemistry","author":"R.E. Merrifield","year":"1989","unstructured":"Merrifield R.E., Simmons H.E.: Topological Methods in Chemistry. Wiley, New York (1989)"},{"key":"1041_CR15","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. Discrete Appl. Math. 152, 246\u2013256 (2005)","journal-title":"Discrete Appl. Math."},{"issue":"6","key":"1041_CR16","doi-asserted-by":"crossref","first-page":"1575","DOI":"10.11650\/twjm\/1500404576","volume":"10","author":"A.S. Pedersen","year":"2006","unstructured":"Pedersen A.S., Vestergaard P.D.: Bounds on the number of vertex independent sets in a graph. Taiwanese J. Math. 10(6), 1575\u20131587 (2006)","journal-title":"Taiwanese J. Math."},{"key":"1041_CR17","first-page":"85","volume":"84","author":"A.S. Pedersen","year":"2007","unstructured":"Pedersen A.S., Vestergaard P.D.: An upper bound on the number of independent sets in a tree. Ars Combin. 84, 85\u201396 (2007)","journal-title":"Ars Combin."},{"issue":"1","key":"1041_CR18","first-page":"16","volume":"20","author":"H. Prodinger","year":"1982","unstructured":"Prodinger H., Tichy R.F.: Fibonacci numbers of graphs. Fibonacci Q. 20(1), 16\u201321 (1982)","journal-title":"Fibonacci Q."},{"issue":"1","key":"1041_CR19","doi-asserted-by":"crossref","first-page":"202","DOI":"10.1007\/s10910-006-9188-4","volume":"43","author":"H. Wang","year":"2008","unstructured":"Wang H., Hua H.: Unicycle graphs with extremal Merrifield\u2013Simmons Index. J. Math. Chem. 43(1), 202\u2013209 (2008)","journal-title":"J. Math. Chem."},{"issue":"2","key":"1041_CR20","doi-asserted-by":"crossref","first-page":"727","DOI":"10.1007\/s10910-006-9224-4","volume":"43","author":"M. Wang","year":"2008","unstructured":"Wang M., Hua H., Wang D.: The first and second largest Merrifield\u2013Simmons indices of trees with prescribed pendent vertices. J. Math. Chem. 43(2), 727\u2013736 (2008)","journal-title":"J. Math. Chem."},{"issue":"1","key":"1041_CR21","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1007\/s10910-006-9088-7","volume":"41","author":"A. Yu","year":"2007","unstructured":"Yu A., Lv X.: The Merrifield\u2013Simmons indices and Hosoya indices of trees with k pendant vertices. J. Math. Chem. 41(1), 33\u201343 (2007)","journal-title":"J. Math. Chem."},{"issue":"3","key":"1041_CR22","doi-asserted-by":"crossref","first-page":"204","DOI":"10.1016\/j.dam.2009.09.001","volume":"158","author":"Z. Zhu","year":"2010","unstructured":"Zhu Z., Li S., Tan L.: Tricyclic graphs with maximum Merrifield\u2013Simmons index. Discrete Appl. Math. 158(3), 204\u2013212 (2010)","journal-title":"Discrete Appl. Math."}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-011-1041-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00373-011-1041-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-011-1041-2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,9]],"date-time":"2019-06-09T14:16:23Z","timestamp":1560089783000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00373-011-1041-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,3,30]]},"references-count":22,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2012,3]]}},"alternative-id":["1041"],"URL":"https:\/\/doi.org\/10.1007\/s00373-011-1041-2","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"value":"0911-0119","type":"print"},{"value":"1435-5914","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,3,30]]}}}