An extremal graph with given bandwidth
نویسندگان
چکیده
منابع مشابه
An extremal graph with given bandwidth
The graph bandwidth problem is a well-known NP-complete problem. The relation between size of a graph and bandwidth is very interesting. The minimum size required in G with bandwidth B is denoted as m(n, B) while the graph G of order n and bandwidth B with size m(n, B) is called an extremal graph. This paper provides the minimum size for a graph of odd order n, n ≥ 9, and bandwidth (n + 1)/2, a...
متن کاملExtremal graph problems with symmetrical extremal graphs. Additional chromatic conditions
The main result of this paper is that for a special, but rather wide class of "sample graphs", the extremal graphs, i.e, the graphs of n vertices without subgraphs isomorphic to the sample graph and having maximum number of edges under this condition, have very simple and sYmmetric structure. This result remains valid even in the case when the' condition "the graph does not contain the sample g...
متن کاملAn extremal graph problem with a transcendental solution
We prove that the number of multigraphs with vertex set {1, . . . , n} such that every four vertices span at most nine edges is a +o(n) where a is transcendental (assuming Schanuel’s conjecture from number theory). This is an easy consequence of the solution to a related problem about maximizing the product of the edge multiplicities in certain multigraphs, and appears to be the first explicit ...
متن کاملOn the spectrum of an extremal graph with four eigenvalues
In this note we study some properties of the spectrum of a connected graph G with four different eigenvalues, and (spectrally maximum) diameter three. When G is regular, this is the case, for instance, when G is a distance-regular graph. © 2006 Elsevier B.V. All rights reserved.
متن کاملAn Extremal Problem in Graph Theory
G(?z; I) will denote a graph of n vertices and 1 edges. Let fO(lz, K) be the smallest integer such that there is a G (n; f,, (n, k)) in which for every set of K vertices there is a vertex joined to each of these. Thus for example fO(3, 2) = 3 since in a triangle each pair of vertices is joined to a third. It can readily be checked that f,(4, 2) = 5 (the extremal graph consists of a complete 4-g...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2007
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2007.03.012