Eigenvalues and separation in graphs

DOI10.1016/0024-3795(93)90030-RzbMath0771.05062MaRDI QIDQ1209408

Dan Pritikin, Zevi Miller

Publication date: 16 May 1993

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

zbMATH Keywords

eigenvaluesmapseparationdiscrete torusedge-isoperimetric problem

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Distance in graphs (05C12)

Related Items

Separation numbers of trees ⋮ A special antidilation problem for meshes and Hamming graphs

Cites Work

• Unnamed Item
• Unnamed Item
• \(\lambda_ 1\), isoperimetric inequalities for graphs, and superconcentrators
• Relations between packing and covering numbers of a tree
• On the separation number of a graph

This page was built for publication: Eigenvalues and separation in graphs