Isoperimetric Problem and Meta-fibonacci Sequences

DOI10.1007/978-3-540-69733-6_3zbMath1148.68418OpenAlexW1820243851MaRDI QIDQ3511309

L. Sunil Chandran, Anita Das, B. V. Subramanya Bharadwaj

Publication date: 10 July 2008

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-69733-6_3

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Special sequences and polynomials (11B83) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (1)

On a generalization of Hofstadter's \(Q\)-sequence: a family of chaotic generational structures

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Isoperimetric invariants for product Markov chains and graph products
• Girth and treewidth
• \(\lambda_ 1\), isoperimetric inequalities for graphs, and superconcentrators
• Meta-Fibonacci sequences, binary trees and extremal compact codes
• Edge-isoperimetric inequalities in the grid
• A well-behaved cousin of the Hofstadter sequence
• A note on the edges of the n-cube
• On an isoperimetric problem for Hamming graphs
• The congestion of \(n\)-cube layout on a rectangular grid
• A lower bound for the vertex boundary-width of complete \(k\)-ary trees
• The carvingwidth of hypercubes
• Optimal numberings and isoperimetric problems on graphs
• Optimal Assignments of Numbers to Vertices

This page was built for publication: Isoperimetric Problem and Meta-fibonacci Sequences