Premium
Maximum Bandwidth Under Edge Addition
Author(s) -
Wang Jianfang,
West Douglas B.,
Yao Bing
Publication year - 1995
Publication title -
journal of graph theory
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.164
H-Index - 54
eISSN - 1097-0118
pISSN - 0364-9024
DOI - 10.1002/jgt.3190200109
Subject(s) - combinatorics , bandwidth (computing) , mathematics , graph , enhanced data rates for gsm evolution , discrete mathematics , computer science , telecommunications
We determine how much the bandwidth B ( G ) of a graph G can increase when a single edge is added. Let g ( b,n ) be the maximum possible value of B ( G + e ) when G has n vertices and bandwidth b . The problem of studying when B ( G + e ) ≦ B ( G ) + 1 was originally possed by Erdos. We determine© 1996 John Wiley & Sons, Inc.
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom