Abstract
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′(G) = minf {B′(f)} where B′(f) is the maximum difference between labels of incident edges of G. The theta graph Θ(l1,…,lm) is the graph consisting of m pairwise internally disjoint paths with common endpoints and lengths l1 ≤ ··· ≤ lm. We determine the edge-bandwidth of all theta graphs. © 2000 John Wiley & Sons, Inc. J Graph Theory 35: 89–98, 2000
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
