Paper Info
Title
Bandwidth of theta graphs with short paths
Abstract
The bandwidth problem for a graph is that of labelling its vertices with distinct integers so that the maximum difference across an edge is minimized. We here solve this problem for all theta graphs. These are graphs which consist of two terminal vertices and a number of paths of possibly varying length between these. Chvatalova and Opatrny (1988) resolved this question when each path has (edge) length at least 4 or all paths have length 3.
Year
DOI
Venue
1992
10.1016/0012-365X(92)90268-K
Discrete Mathematics
Keywords
Field
DocType
theta graph,short path
Integer,Discrete mathematics,Graph,Combinatorics,Path length,Vertex (geometry),Bandwidth (signal processing),Graph bandwidth,Theta graph,Mathematics,Graph labelling
Journal
Volume
Issue
ISSN
103
2
Discrete Mathematics
Citations 
PageRank 
References 
7
0.96
2
Authors
2
Name
Order
Citations
PageRank
G. W. Peck1274.13
Aditya Shastri25212.29