{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T06:13:17Z","timestamp":1725516797070},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540697329"},{"type":"electronic","value":"9783540697336"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-69733-6_3","type":"book-chapter","created":{"date-parts":[[2008,8,12]],"date-time":"2008-08-12T12:07:43Z","timestamp":1218542863000},"page":"22-30","source":"Crossref","is-referenced-by-count":1,"title":["Isoperimetric Problem and Meta-fibonacci Sequences"],"prefix":"10.1007","author":[{"given":"B. V. S.","family":"Bharadwaj","sequence":"first","affiliation":[]},{"given":"L. S.","family":"Chandran","sequence":"additional","affiliation":[]},{"given":"Anita","family":"Das","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"3_CR1","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1016\/0095-8956(85)90092-9","volume":"38","author":"N. Alon","year":"1985","unstructured":"Alon, N., Millman, V.D.: \u03bb 1, Isoperimetric Inequalities for Graphs and Super Concentrators. Journal of Combinatorial Theory Series B\u00a038, 73\u201388 (1985)","journal-title":"Journal of Combinatorial Theory, Series B"},{"key":"3_CR2","first-page":"157","volume-title":"Graph Theory and Combinatorial Biology","author":"S.L. Bezrukov","year":"1999","unstructured":"Bezrukov, S.L.: Edge Isoperimetric Problems of Graphs. In: Graph Theory and Combinatorial Biology, vol.\u00a07, pp. 157\u2013197. Bolyai Soc. Math. Stud., Budapest (1999)"},{"key":"3_CR3","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1016\/S0012-365X(99)00162-4","volume":"213","author":"S.L. Bezrukov","year":"2000","unstructured":"Bezrukov, S.L., Chavez, J.D., Harper, L.H., R\u00f6ttger, M., Schroeder, U.-P.: The Congestion of n\u2013cube Layout on a Rectangular Grid. Discrete Mathematics\u00a0213, 13\u201319 (2000)","journal-title":"Discrete Mathematics"},{"key":"3_CR4","first-page":"1","volume":"11","author":"H.L. Bodlaender","year":"1993","unstructured":"Bodlaender, H.L.: A Tourist Guide Through Treewidth. Acta Cybernetica\u00a011, 1\u201321 (1993)","journal-title":"Acta Cybernetica"},{"key":"3_CR5","volume-title":"Combinatorics","author":"B. Bollob\u00e1s","year":"1986","unstructured":"Bollob\u00e1s, B.: Combinatorics. Cambridge University Press, Cambridge (1986)"},{"key":"3_CR6","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1007\/BF01275667","volume":"11","author":"B. Bollob\u00e1s","year":"1991","unstructured":"Bollob\u00e1s, B., Leader, I.: Edge-Isoperimetric Inequalities in the Grid. Combinatorica\u00a011, 299\u2013314 (1991)","journal-title":"Combinatorica"},{"key":"3_CR7","unstructured":"Chandran, L.\u00a0S., Kavitha, T.: Treewidth and Pathwidth of Hypercubes. Special Issue of Discrete Mathematics on Minimal Separation and Chordal Completion (to appear, 2005)"},{"key":"3_CR8","unstructured":"Chandran, L.S., Kavitha, T.: The Carvingwidth of Hypercubes (2006)"},{"key":"3_CR9","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1016\/j.jctb.2004.05.004","volume":"93","author":"L.S. Chandran","year":"2005","unstructured":"Chandran, L.S., Subramanian, C.R.: Girth and Treewidth. Journal of Combinatorial Theory Series B\u00a093, 23\u201332 (2005)","journal-title":"Journal of Combinatorial Theory Series B"},{"key":"3_CR10","volume-title":"Graph Theory","author":"R. Diestel","year":"2000","unstructured":"Diestel, R.: Graph Theory, 2nd edn. vol.\u00a0173. Springer, New York (2000)","edition":"2"},{"key":"3_CR11","doi-asserted-by":"publisher","first-page":"186","DOI":"10.2307\/2323338","volume":"93","author":"R.K. Guy","year":"1986","unstructured":"Guy, R.K.: Some Suspiciously Simple Sequences. Amer. Math. Monthly\u00a093, 186\u2013190 (1986)","journal-title":"Amer. Math. Monthly"},{"key":"3_CR12","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1137\/0112012","volume":"12","author":"L. Harper","year":"1964","unstructured":"Harper, L.: Optimal Assignments of Numbers to Vertices. Jour. Soc. Indust. Appl. Math.\u00a012, 131\u2013135 (1964)","journal-title":"Jour. Soc. Indust. Appl. Math."},{"key":"3_CR13","doi-asserted-by":"publisher","first-page":"385","DOI":"10.1016\/S0021-9800(66)80059-5","volume":"1","author":"L. Harper","year":"1966","unstructured":"Harper, L.: Optimal Numberings and Isoperimetric Problems on Graphs. Journal of Combinatorial Theory\u00a01, 385\u2013393 (1966)","journal-title":"Journal of Combinatorial Theory"},{"key":"3_CR14","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1016\/S0166-218X(99)00082-7","volume":"95","author":"L. Harper","year":"1999","unstructured":"Harper, L.: On an Isoperimetric Problem for Hamming Graphs. Discrete Applied Mathematics\u00a095, 285\u2013309 (1999)","journal-title":"Discrete Applied Mathematics"},{"key":"3_CR15","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511616679","volume-title":"Global Methods for Combinatorial Isoperimetric Problems","author":"L.H. Harper","year":"2004","unstructured":"Harper, L.H.: Global Methods for Combinatorial Isoperimetric Problems. Cambridge University Press, Cambridge (2004)"},{"key":"3_CR16","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1016\/0012-365X(76)90058-3","volume":"14","author":"S. Hart","year":"1976","unstructured":"Hart, S.: A Note on the Edges of the n\u2013cube. Discrete Mathematics\u00a014, 157\u2013163 (1976)","journal-title":"Discrete Mathematics"},{"key":"3_CR17","volume-title":"G\u00f6del, Escher, Bach. An Eternal Golden Braid","author":"D. Hofstadter","year":"1979","unstructured":"Hofstadter, D., G\u00f6del, Escher, Bach: An Eternal Golden Braid. Basic Books, New york (1979)"},{"key":"3_CR18","doi-asserted-by":"publisher","first-page":"359","DOI":"10.1007\/s00493-004-0023-x","volume":"24","author":"C. Houdr\u00e9","year":"2004","unstructured":"Houdr\u00e9, C., Tetali, P.: Isoperimetric Invariants for Product Markov Chains and Graph Products. Combinatorica\u00a024, 359\u2013388 (2004)","journal-title":"Combinatorica"},{"issue":"1","key":"3_CR19","doi-asserted-by":"crossref","first-page":"13","DOI":"10.37236\/1052","volume":"13","author":"B. Jackson","year":"2006","unstructured":"Jackson, B., Ruskey, F.: Meta-Fibonacci Sequences, Binary Trees and Extremal Compact Codes. Electron. J. Combin. 13(1); Research Paper 26, p.13 (2006) (electronic)","journal-title":"Electron. J. Combin."},{"key":"3_CR20","doi-asserted-by":"crossref","unstructured":"Leader, I.: Discrete Isoperimetric Inequalities. In: Proc. Symp. Appl. Math, vol.\u00a044, pp. 57\u201380 (1991)","DOI":"10.1090\/psapm\/044\/1141923"},{"key":"3_CR21","doi-asserted-by":"crossref","unstructured":"Otachi, Y., Yamazaki, K.: A Lower Bound for the Vertex Boundary-Width of Complete k-ary Trees. Discrete Mathematics (in Press)","DOI":"10.1016\/j.disc.2007.05.014"},{"key":"3_CR22","doi-asserted-by":"publisher","first-page":"227","DOI":"10.1016\/0012-365X(92)90145-6","volume":"105","author":"S.M. Tanny","year":"1992","unstructured":"Tanny, S.M.: A Well-Behaved Cousin of the Hofstadter Sequence. Discrete Mathematics\u00a0105, 227\u2013239 (1992)","journal-title":"Discrete Mathematics"}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-69733-6_3.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,19]],"date-time":"2020-11-19T00:02:15Z","timestamp":1605744135000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-69733-6_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540697329","9783540697336"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-69733-6_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[]}}