An extremal graph with given bandwidth

DOI10.1016/J.TCS.2007.03.012zbMATH Open1117.05058OpenAlexW2001966978MaRDI QIDQ884479FDOQ884479

Authors: Yung-Ling Lai, Chang-Sin Tian 

Publication date: 6 June 2007

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2007.03.012

Recommendations

• New classes of extremal graphs with given bandwidth
• scientific article; zbMATH DE number 812088
• scientific article; zbMATH DE number 1895637
• scientific article; zbMATH DE number 1778090
• On the size of graphs of a given bandwidth

zbMATH Keywords

bandwidthextremal graph

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• The NP-completeness of the bandwidth minimization problem
• Complexity Results for Bandwidth Minimization
• A survey of solved problems and applications on bandwidth, edgesum, and profile of graphs
• The bandwidth problem for graphs and matrices—a survey
• On the size of graphs of a given bandwidth
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (5)

• Multilevel Bandwidth and Radio Labelings of Graphs
• An extremal bandwidth problem for bipartite graphs
• Title not available (Why is that?)
• New classes of extremal graphs with given bandwidth
• Edge minimum graphs with given order and bandwidth

This page was built for publication: An extremal graph with given bandwidth

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