scientific article; zbMATH DE number 861319

MaRDI QIDQ4871043zbMATH OpenFDO

Authors Z. Miller, Dan Pritikin

Publication date 17 July 1996

zbMATH Keywords

bandwidthbipartite graphscomplete graphsdistanceeigenvaluehypercubesisoperimetric inequalitiesKruskal-Katona theoremseparationseparatorstrees

Mathematics Subject Classification ID

Trees (05C05) Extremal problems in graph theory (05C35) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Graph algorithms (graph-theoretic aspects) (05C85)

Recommendations

• Eigenvalues and separation in graphs
• scientific article; zbMATH DE number 638688
• On the separation number of a graph

Cited in

(9)

• On the path separation number of graphs
• On the separation number of a graph
• scientific article; zbMATH DE number 1188869 (Why is no real title available?)
• Graphs of separability at most 2
• An approach to emulating separable graphs
• scientific article; zbMATH DE number 638688 (Why is no real title available?)
• A special antidilation problem for meshes and Hamming graphs
• Asymptotic Bounds on the Integrity of Graphs and Separator Theorems for Graphs
• Separation numbers of trees

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4871043)