{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,13]],"date-time":"2026-03-13T13:41:47Z","timestamp":1773409307670,"version":"3.50.1"},"reference-count":15,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2011,1,21]],"date-time":"2011-01-21T00:00:00Z","timestamp":1295568000000},"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":[[2012,10]]},"DOI":"10.1007\/s10878-011-9376-4","type":"journal-article","created":{"date-parts":[[2011,1,20]],"date-time":"2011-01-20T17:16:45Z","timestamp":1295543805000},"page":"192-201","source":"Crossref","is-referenced-by-count":3,"title":["The second largest number of maximal independent sets in connected graphs with at most one cycle"],"prefix":"10.1007","volume":"24","author":[{"given":"Min-Jen","family":"Jou","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2011,1,21]]},"reference":[{"issue":"2","key":"9376_CR1","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1142\/S012905410300173X","volume":"14","author":"K Alzoubi","year":"2003","unstructured":"Alzoubi K, Wan P-J, Frieder O (2003) Maximal independent set, weakly-connected dominating set, and induced spanners in wireless ad hoc networks. Int J Found Comput Sci 14(2):287\u2013303","journal-title":"Int J Found Comput Sci"},{"key":"9376_CR2","first-page":"517","volume-title":"Proceedings of the 11th IASTED international conference on parallel and distributed computing and systems (PDCS)","author":"S Basagni","year":"1999","unstructured":"Basagni S (1999) A distributed algorithm for finding a maximal weighted independent set in wireless networks. In: Proceedings of the 11th IASTED international conference on parallel and distributed computing and systems (PDCS), pp 517\u2013522"},{"issue":"1\u20133","key":"9376_CR3","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1016\/0166-218X(88)90010-8","volume":"19","author":"S El-Basil","year":"1988","unstructured":"El-Basil S (1988) Binomial-combinatorial properties of Clar structures. Discrete Appl Math 19(1\u20133):145\u2013156","journal-title":"Discrete Appl Math"},{"key":"9376_CR4","doi-asserted-by":"crossref","first-page":"284","DOI":"10.1137\/0406022","volume":"6","author":"M Hujter","year":"1993","unstructured":"Hujter M, Tuza Z (1993) The number of maximal independent sets in triangle-free graphs. SIAM J Discrete Math 6:284\u2013288","journal-title":"SIAM J Discrete Math"},{"key":"9376_CR5","doi-asserted-by":"crossref","first-page":"5864","DOI":"10.1016\/j.disc.2007.10.032","volume":"308","author":"Z Jin","year":"2008","unstructured":"Jin Z, Li X (2008) Graphs with the second largest number of maximal independent sets. Discrete Math 308:5864\u20135870","journal-title":"Discrete Math"},{"key":"9376_CR6","first-page":"265","volume-title":"Proceedings of the second Asian mathematical conference","author":"MJ Jou","year":"1995","unstructured":"Jou MJ, Chang GJ (1995) Survey on counting maximal independent sets. In: Tangmance S, Schulz E (eds) Proceedings of the second Asian mathematical conference. World Scientific, Singapore, pp\u00a0265\u2013275"},{"key":"9376_CR7","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1016\/S0166-218X(97)00033-4","volume":"79","author":"MJ Jou","year":"1997","unstructured":"Jou MJ, Chang GJ (1997) Maximal independent sets in graphs with at most one cycle. Discrete Appl Math 79:67\u201373","journal-title":"Discrete Appl Math"},{"key":"9376_CR8","first-page":"265","volume":"65","author":"MJ Jou","year":"2002","unstructured":"Jou MJ, Chang GJ (2002) Algorithmic aspects of counting independent sets. Ars Comb 65:265\u2013277","journal-title":"Ars Comb"},{"key":"9376_CR9","doi-asserted-by":"crossref","first-page":"4469","DOI":"10.1016\/j.disc.2009.02.007","volume":"309","author":"M-J Jou","year":"2009","unstructured":"Jou M-J, Lin J-J (2009) Trees with the second largest number of maximal independent sets. Discrete Math 309:4469\u20134474","journal-title":"Discrete Math"},{"key":"9376_CR10","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"},{"key":"9376_CR11","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1007\/BF02760024","volume":"3","author":"JW Moon","year":"1965","unstructured":"Moon JW, Moser L (1965) On cliques in graphs. Isr J Math 3:23\u201328","journal-title":"Isr J Math"},{"key":"9376_CR12","first-page":"51","volume-title":"Proc of 1-st international conference on mobile ad hoc and sensor systems","author":"T Moscibroda","year":"2004","unstructured":"Moscibroda T, Wattenhofer R (2004) Efficient computation of maximal independent sets in unstructured multi-hop radio networks. In: Proc of 1-st international conference on mobile ad hoc and sensor systems, pp 51\u201359"},{"issue":"2","key":"9376_CR13","doi-asserted-by":"crossref","first-page":"443","DOI":"10.1021\/ci025605o","volume":"43","author":"N Rhodes","year":"2003","unstructured":"Rhodes N, Willett P, Calvet A, Dunbar JB, Humblet C (2003) CLIP: similarity searching of 3D databases using clique detection. J Chem Inf Comput Sci 43(2):443\u2013448","journal-title":"J Chem Inf Comput Sci"},{"key":"9376_CR14","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:16\u201321","journal-title":"Fibonacci Q"},{"key":"9376_CR15","doi-asserted-by":"crossref","first-page":"362","DOI":"10.1080\/00150517.2006.12428306","volume":"44","author":"SG Wagner","year":"2006","unstructured":"Wagner SG (2006) The Fibonacci number of generalized Petersen graphs. Fibonacci Q 44:362\u2013367","journal-title":"Fibonacci Q"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-011-9376-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-011-9376-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-011-9376-4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,1]],"date-time":"2025-03-01T23:49:59Z","timestamp":1740872999000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-011-9376-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,1,21]]},"references-count":15,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2012,10]]}},"alternative-id":["9376"],"URL":"https:\/\/doi.org\/10.1007\/s10878-011-9376-4","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,1,21]]}}}