The edge-bandwidth of theta graphs
โ
Dennis Eichhorn; Dhruv Mubayi; Kevin O'Bryant; Douglas B. West
๐
Article
๐
2000
๐
John Wiley and Sons
๐
English
โ 129 KB
An edge-labeling f of a graph G is an injection from E(G) to the set of integers. The edge-bandwidth of G is B H (G) min f {B H (f )}, where B H (f ) is the maximum difference between labels of incident edges of G. The theta graph ร(l 1 , F F F ,l m ) is the graph consisting of m pairwise internally