Revision as of 13:00, 29 March 2014 edit Monkbot (talk \| contribs) Bots 3,695,952 edits m →References: Task 1c: Fix CS1 deprecated date parameter errors ← Previous edit		Revision as of 01:27, 20 April 2014 edit undo David Eppstein (talk \| contribs) Autopatrolled, Administrators 235,802 edits relation to proper interval graphs Next edit →
Line 5: In terms of matrices, the (unweighted) graph bandwidth is the [[bandwidth (matrix theory)\|bandwidth]] of the [[symmetric matrix]] which is the [[adjacency matrix]] of the graph. The bandwidth may also be defined as one less than the [[maximum clique]] size in a [[proper interval graph\|proper interval]] supergraph of the given graph, chosen to minimize its clique size {{harv\|Kaplan\|Shamir\|1996}}. ==Bandwidth formulas for some graphs== Line 117 ⟶ 118: \| title = Pathwidth, bandwidth, and completion problems to proper interval graphs with small cliques \| year = 1996 \| journal = [[SIAM Journal on Computing]] \| pages = 540–561 \| volume = 25

Graph bandwidth: Difference between revisions