scientific article; zbMATH DE number 1382527
From MaRDI portal
Publication:3837151
The Morgan-Scott graph \(G(k, s)\) is the graph obtained by taking a cycle with \(s\) vertices and adding to each vertex of the cycle \(k-1\) edges to a vertex of degree one. The bandwidth of a graph \(G\) is the minimum over all bijections \[ f:V_G\to \{1,2,\dots,|V_G|\}\text{ of }\max\{|f(v)-f(w)|:\{v,w\}\in E_G\}. \] This paper establishes precise bounds for the bandwidth of the line graphs of Morgan-Scott graphs. The bandwidth of the line graph of \(G\) is also called the belt-length of \(G\).
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 Q3837151)
