Bandwidth edge counts for linear arrangements of rectangular grids

DOI10.1002/(SICI)1097-0118(199712)26:4%3C195::AID-JGT3%3E3.0.CO;2-LMaRDI QIDQ4376494zbMATH OpenOpenAlexFDO

Authors Paul Wright, Peter Fishburn

Publication date 11 February 1998

Full work available at URL https://doi.org/10.1002/(sici)1097-0118(199712)26:4%3C195::aid-jgt3%3E3.0.co;2-l

zbMATH Keywords

bandwidthrectangular gridslinear arrangement

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Recommendations

• Edge-bandwidth of grids and tori
• Edge-bandwidth of the triangular grid
• scientific article; zbMATH DE number 3963886
• New bounds on the edge-bandwidth of triangular grids
• Asymptotic Determination of Edge-Bandwidth of Multidimensional Grids and Hamming Graphs
• Edge-Bandwidth of Graphs
• Edge-isoperimetric inequalities in the grid
• scientific article; zbMATH DE number 434702
• scientific article; zbMATH DE number 1382527
• On the bandwidth of triangulated triangles

Cited in

(4)

• Edge-bandwidth of the triangular grid
• Bandwidth reduction in rectangular grids
• Bounds on mincut for Cayley graphs over Abelian groups
• Optimal linear arrangement of a rectangular grid

This page was built for publication: Bandwidth edge counts for linear arrangements of rectangular grids

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