{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,25]],"date-time":"2026-01-25T04:19:46Z","timestamp":1769314786439,"version":"3.49.0"},"publisher-location":"Berlin, Heidelberg","reference-count":25,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540850960","type":"print"},{"value":"9783540850977","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-85097-7_12","type":"book-chapter","created":{"date-parts":[[2008,8,19]],"date-time":"2008-08-19T07:18:26Z","timestamp":1219130306000},"page":"127-138","source":"Crossref","is-referenced-by-count":2,"title":["Tur\u00e1n Graphs, Stability Number, and Fibonacci Index"],"prefix":"10.1007","author":[{"given":"V\u00e9ronique","family":"Bruy\u00e8re","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hadrien","family":"M\u00e9lot","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"12_CR1","volume-title":"The Theory of Graphs","author":"C. Berge","year":"2001","unstructured":"Berge, C.: The Theory of Graphs. Dover Publications, New York (2001)"},{"key":"12_CR2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1002\/jgt.20289","volume":"58","author":"N. Bougard","year":"2008","unstructured":"Bougard, N., Joret, G.: Tur\u00e1n Theorem and k-connected graphs. J. Graph Theory\u00a058, 1\u201313 (2008)","journal-title":"J. Graph Theory"},{"key":"12_CR3","doi-asserted-by":"publisher","first-page":"194","DOI":"10.1017\/S030500410002168X","volume":"37","author":"R.-L. Brooks","year":"1941","unstructured":"Brooks, R.-L.: On colouring the nodes of a network. Proc. Cambridge Philos. Soc.\u00a037, 194\u2013197 (1941)","journal-title":"Proc. Cambridge Philos. Soc."},{"key":"12_CR4","doi-asserted-by":"publisher","first-page":"547","DOI":"10.1016\/j.orl.2004.03.002","volume":"32","author":"J.M. Byskov","year":"2004","unstructured":"Byskov, J.M.: Enumerating maximal independent sets with applications to graph colouring. Oper. Res. Lett.\u00a032, 547\u2013556 (2004)","journal-title":"Oper. Res. Lett."},{"key":"12_CR5","doi-asserted-by":"crossref","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.: Linear inequalities among graph invariants: using GraPHedron to uncover optimal relationships, 24 pages (Accepted for publication in Networks, 2008)","DOI":"10.1002\/net.20250"},{"key":"12_CR6","first-page":"181","volume":"6","author":"P. Erd\u00f6s","year":"1961","unstructured":"Erd\u00f6s, P., Gallai, T.: On the minimal number of vertices representing the edges of a graph. Magyar Tud. Akad. Mat. Kutat\u00f3 Int. K\u00f6zl.\u00a06, 181\u2013203 (1961)","journal-title":"Magyar Tud. Akad. Mat. Kutat\u00f3 Int. K\u00f6zl."},{"key":"12_CR7","unstructured":"GraPHedron: Reports on the study of the Fibonacci index and the stability number of graphs and connected graphs, www.graphedron.net\/index.php?page=viewBib&bib=7"},{"key":"12_CR8","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":"12_CR9","doi-asserted-by":"publisher","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\u00a058, 49\u201368 (2008)","journal-title":"J. Graph Theory"},{"key":"12_CR10","unstructured":"Joret, G.: Entropy and Stability in Graphs. PhD thesis, Universit\u00e9 Libre de Bruxelles, Belgium (2007)"},{"key":"12_CR11","doi-asserted-by":"publisher","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.\u00a0155, 1175\u20131187 (2007)","journal-title":"Discrete Appl. Math."},{"issue":"1","key":"12_CR12","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1089\/106652703763255660","volume":"10","author":"X. Li","year":"2003","unstructured":"Li, X., Li, Z., Wang, L.: The Inverse Problems for Some Topological Indices in Combinatorial Chemistry. J. Comput. Biol.\u00a010(1), 47\u201355 (2003)","journal-title":"J. Comput. Biol."},{"key":"12_CR13","first-page":"389","volume":"54","author":"X. Li","year":"2005","unstructured":"Li, X., Zhao, H., Gutman, I.: On the Merrifield-Simmons Index of Trees. MATCH Comm. Math. Comp. Chem.\u00a054, 389\u2013402 (2005)","journal-title":"MATCH Comm. Math. Comp. Chem."},{"key":"12_CR14","volume-title":"Matching Theory. Akad\u00e9miai Kiad\u00f3","author":"L. Lov\u00e1sz","year":"1986","unstructured":"Lov\u00e1sz, L., Plummer, M.D.: Matching Theory. Akad\u00e9miai Kiad\u00f3. North-Holland, Budapest (1986)"},{"key":"12_CR15","doi-asserted-by":"crossref","unstructured":"M\u00e9lot, H.: Facet defining inequalities among graph invariants: the system GraPHedron. Discrete Appl. Math., 17 pages (Accepted for publication, 2007)","DOI":"10.1016\/j.dam.2007.09.005"},{"key":"12_CR16","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":"12_CR17","doi-asserted-by":"publisher","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.\u00a0152, 246\u2013256 (2005)","journal-title":"Discrete Appl. Math."},{"issue":"6","key":"12_CR18","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.\u00a010(6), 1575\u20131587 (2006)","journal-title":"Taiwanese J. Math."},{"key":"12_CR19","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.\u00a084, 85\u201396 (2007)","journal-title":"Ars Combin."},{"issue":"1","key":"12_CR20","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 Quart.\u00a020(1), 16\u201321 (1982)","journal-title":"Fibonacci Quart."},{"issue":"7","key":"12_CR21","doi-asserted-by":"publisher","first-page":"1004","DOI":"10.1089\/cmb.2005.12.1004","volume":"12","author":"R.F. Tichy","year":"2005","unstructured":"Tichy, R.F., Wagner, S.: Extremal Problems for Topological Indices in Combinatorial Chemistry. J. Comput. Biol.\u00a012(7), 1004\u20131013 (2005)","journal-title":"J. Comput. Biol."},{"key":"12_CR22","first-page":"436","volume":"48","author":"P. Tur\u00e1n","year":"1941","unstructured":"Tur\u00e1n, P.: Eine Extremalaufgabe aus der Graphentheorie. Mat. Fiz. Lapok\u00a048, 436\u2013452 (1941)","journal-title":"Mat. Fiz. Lapok"},{"key":"12_CR23","first-page":"221","volume":"57","author":"S. Wagner","year":"2007","unstructured":"Wagner, S.: Extremal trees with respect to Hosoya Index and Merrifield-Simmons Index. MATCH Comm. Math. Comp. Chem.\u00a057, 221\u2013233 (2007)","journal-title":"MATCH Comm. Math. Comp. Chem."},{"issue":"1","key":"12_CR24","doi-asserted-by":"publisher","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-Simmons Index. J. Math. Chem.\u00a043(1), 202\u2013209 (2008)","journal-title":"J. Math. Chem."},{"issue":"2","key":"12_CR25","doi-asserted-by":"publisher","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-Simmons indices of trees with prescribed pendent vertices. J. Math. Chem.\u00a043(2), 727\u2013736 (2008)","journal-title":"J. Math. Chem."}],"container-title":["Lecture Notes in Computer Science","Combinatorial Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-85097-7_12.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,31]],"date-time":"2025-01-31T15:27:56Z","timestamp":1738337276000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-85097-7_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540850960","9783540850977"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-85097-7_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[]}}