{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,28]],"date-time":"2025-09-28T12:50:14Z","timestamp":1759063814760,"version":"3.37.0"},"reference-count":29,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2009,5,21]],"date-time":"2009-05-21T00:00:00Z","timestamp":1242864000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2009,10]]},"DOI":"10.1007\/s10878-009-9228-7","type":"journal-article","created":{"date-parts":[[2009,5,20]],"date-time":"2009-05-20T16:34:17Z","timestamp":1242837257000},"page":"207-228","source":"Crossref","is-referenced-by-count":8,"title":["Fibonacci index and stability number of graphs: a\u00a0polyhedral study"],"prefix":"10.1007","volume":"18","author":[{"given":"V\u00e9ronique","family":"Bruy\u00e8re","sequence":"first","affiliation":[]},{"given":"Hadrien","family":"M\u00e9lot","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2009,5,21]]},"reference":[{"key":"9228_CR1","volume-title":"The theory of graphs","author":"C Berge","year":"2001","unstructured":"Berge C (2001) The theory of graphs. Dover, New York"},{"key":"9228_CR2","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1002\/jgt.20289","volume":"58","author":"N Bougard","year":"2008","unstructured":"Bougard N, Joret G (2008) Tur\u00e1n Theorem and k-connected graphs. J Graph Theory 58:1\u201313","journal-title":"J Graph Theory"},{"key":"9228_CR3","doi-asserted-by":"crossref","first-page":"194","DOI":"10.1017\/S030500410002168X","volume":"37","author":"R-L Brooks","year":"1941","unstructured":"Brooks R-L (1941) On colouring the nodes of a network. Proc Camb Philos Soc 37:194\u2013197","journal-title":"Proc Camb Philos Soc"},{"key":"9228_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1007\/978-3-540-85097-7_12","volume-title":"Combinatorial Optimization and Applications, COCOA 2008","author":"V Bruy\u00e8re","year":"2008","unstructured":"Bruy\u00e8re V, M\u00e9lot H (2008) Tur\u00e0n graphs, stability number, and Fibonacci index. In: Combinatorial Optimization and Applications, COCOA 2008, St. John\u2019s, Newfoundland, Canada, 2008. Lecture Notes in Computer Science, vol 5165. Springer, Berlin, pp 127\u2013138"},{"key":"9228_CR5","doi-asserted-by":"crossref","first-page":"547","DOI":"10.1016\/j.orl.2004.03.002","volume":"32","author":"JM Byskov","year":"2004","unstructured":"Byskov JM (2004) Enumerating maximal independent sets with applications to graph colouring. Oper Res Lett 32:547\u2013556","journal-title":"Oper Res Lett"},{"key":"9228_CR6","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1002\/net.20250","volume":"52","author":"J Christophe","year":"2008","unstructured":"Christophe J, Dewez S, Doignon J-P, Elloumi S, Fasbender G, Gr\u00e9goire P, Huygens D, Labb\u00e9 M, M\u00e9lot H, Yaman H (2008) Linear inequalities among graph invariants: using GraPHedron to uncover optimal relationships. Networks 52:287\u2013298","journal-title":"Networks"},{"key":"9228_CR7","first-page":"181","volume":"6","author":"P Erd\u00f6s","year":"1961","unstructured":"Erd\u00f6s P, Gallai T (1961) On the minimal number of vertices representing the edges of a graph. M Tud Akad Mat Kut Int\u00e9z K\u00f6zl 6:181\u2013203","journal-title":"M Tud Akad Mat Kut Int\u00e9z K\u00f6zl"},{"key":"9228_CR8","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-0933-1","volume-title":"Graph theory applications","author":"LR Foulds","year":"1992","unstructured":"Foulds LR (1992) Graph theory applications. Springer, New York"},{"key":"9228_CR9","unstructured":"GraPHedron (2009) Reports on the study of the Fibonacci index and the stability number of graphs and connected graphs. URL: www.graphedron.net\/index.php?page=viewBib&bib=10"},{"key":"9228_CR10","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 OE (1986) Mathematical concepts in organic chemistry. Springer, Berlin"},{"key":"9228_CR11","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1016\/0012-365X(87)90139-7","volume":"65","author":"B Hedman","year":"1987","unstructured":"Hedman B (1987) Another extremal problem for Tur\u00e1n graphs. Discrete Math 65:173\u2013176","journal-title":"Discrete Math"},{"key":"9228_CR12","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1002\/jgt.20294","volume":"58","author":"C Heuberger","year":"2008","unstructured":"Heuberger C, Wagner S (2008) Maximizing the number of independent subsets over trees with bounded degree. J Graph Theory 58:49\u201368","journal-title":"J Graph Theory"},{"key":"9228_CR13","unstructured":"Joret G (2007) Entropy and stability in graphs. PhD thesis, Universit\u00e9 Libre de Bruxelles, Belgium"},{"key":"9228_CR14","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 RF, Wagner S, Ziegler V (2007) Graphs, partitions and Fibonacci numbers. Discrete Appl Math 155:1175\u20131187","journal-title":"Discrete Appl Math"},{"issue":"1","key":"9228_CR15","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1089\/106652703763255660","volume":"10","author":"X Li","year":"2003","unstructured":"Li X, Li Z, Wang L (2003) The Inverse Problems for Some Topological Indices in Combinatorial Chemistry. J Comput Biol 10(1):47\u201355","journal-title":"J Comput Biol"},{"key":"9228_CR16","first-page":"389","volume":"54","author":"X Li","year":"2005","unstructured":"Li X, Zhao H, Gutman I (2005) On the Merrifield-Simmons Index of Trees. MATCH Commun Math Comput Chem 54:389\u2013402","journal-title":"MATCH Commun Math Comput Chem"},{"key":"9228_CR17","volume-title":"Combinatorial problems and exercises","author":"L Lov\u00e1sz","year":"1993","unstructured":"Lov\u00e1sz L (1993) Combinatorial problems and exercises, 2nd edn. North-Holland, Amsterdam","edition":"2"},{"key":"9228_CR18","volume-title":"Matching Theory","author":"L Lov\u00e1sz","year":"1986","unstructured":"Lov\u00e1sz L, Plummer MD (1986) Matching Theory. Akad\u00e9miai Kiad\u00f3\u2013North-Holland, Budapest"},{"key":"9228_CR19","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 (2008) Facet defining inequalities among graph invariants: the system GraPHedron. Discrete Appl Math 156:1875\u20131891","journal-title":"Discrete Appl Math"},{"key":"9228_CR20","volume-title":"Topological methods in chemistry","author":"RE Merrifield","year":"1989","unstructured":"Merrifield RE, Simmons HE (1989) Topological methods in chemistry. Wiley, New York"},{"key":"9228_CR21","doi-asserted-by":"crossref","first-page":"246","DOI":"10.1016\/j.dam.2005.04.002","volume":"152","author":"AS Pedersen","year":"2005","unstructured":"Pedersen AS, Vestergaard PD (2005) The number of independent sets in unicyclic graphs. Discrete Appl Math 152:246\u2013256","journal-title":"Discrete Appl Math"},{"issue":"6","key":"9228_CR22","doi-asserted-by":"crossref","first-page":"1575","DOI":"10.11650\/twjm\/1500404576","volume":"10","author":"AS Pedersen","year":"2006","unstructured":"Pedersen AS, Vestergaard PD (2006) Bounds on the number of vertex independent sets in a graph. Taiwan J Math 10(6):1575\u20131587","journal-title":"Taiwan J Math"},{"key":"9228_CR23","first-page":"85","volume":"84","author":"AS Pedersen","year":"2007","unstructured":"Pedersen AS, Vestergaard PD (2007) An upper bound on the number of independent sets in a tree. Ars Comb 84:85\u201396","journal-title":"Ars Comb"},{"issue":"1","key":"9228_CR24","doi-asserted-by":"crossref","first-page":"16","DOI":"10.1080\/00150517.1982.12430021","volume":"20","author":"H Prodinger","year":"1982","unstructured":"Prodinger H, Tichy RF (1982) Fibonacci numbers of graphs. Fibonacci Q 20(1):16\u201321","journal-title":"Fibonacci Q"},{"issue":"7","key":"9228_CR25","doi-asserted-by":"crossref","first-page":"1004","DOI":"10.1089\/cmb.2005.12.1004","volume":"12","author":"RF Tichy","year":"2005","unstructured":"Tichy RF, Wagner S (2005) Extremal problems for topological indices in combinatorial chemistry. J Comput Biol 12(7):1004\u20131013","journal-title":"J Comput Biol"},{"key":"9228_CR26","first-page":"436","volume":"48","author":"P Tur\u00e1n","year":"1941","unstructured":"Tur\u00e1n P (1941) Eine Extremalaufgabe aus der Graphentheorie. Mat Fiz Lapok 48:436\u2013452","journal-title":"Mat Fiz Lapok"},{"key":"9228_CR27","first-page":"221","volume":"57","author":"S Wagner","year":"2007","unstructured":"Wagner S (2007) Extremal trees with respect to Hosoya Index and Merrifield-Simmons Index. MATCH Commun Math Comput Chem 57:221\u2013233","journal-title":"MATCH Commun Math Comput Chem"},{"issue":"1","key":"9228_CR28","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 (2008) Unicycle graphs with extremal Merrifield-Simmons Index. J Math Chem 43(1):202\u2013209","journal-title":"J Math Chem"},{"issue":"2","key":"9228_CR29","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 (2008) The first and second largest Merrifield-Simmons indices of trees with prescribed pendent vertices. J Math Chem 43(2):727\u2013736","journal-title":"J Math Chem"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-009-9228-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-009-9228-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-009-9228-7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,9]],"date-time":"2025-02-09T16:19:57Z","timestamp":1739117997000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-009-9228-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,5,21]]},"references-count":29,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2009,10]]}},"alternative-id":["9228"],"URL":"https:\/\/doi.org\/10.1007\/s10878-009-9228-7","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"type":"print","value":"1382-6905"},{"type":"electronic","value":"1573-2886"}],"subject":[],"published":{"date-parts":[[2009,5,21]]}}}