summary:In this paper, we improve the result by Harper on the lower bound of the bandwidth of connected graphs. In addition, we prove that considerating the interior boundary and the exterior boundary when estimating the bandwidth of connected graphs gives the same results
AbstractThe bandwidth of the Hamming graph (the product, (Kn)d, of complete graphs) has been an open...
Introduction Given an undirected graph G = (V; E) on n vertices, a linear arrangement (also called ...
The bandwidth of a graph is the minimum, over vertex labelings with distinct integers, of the maximu...
summary:In this paper, we improve the result by Harper on the lower bound of the bandwidth of connec...
AbstractWe give a general Harper-type lower bound for the bandwidth of a graph which is a common gen...
AbstractLet G,H be finite graphs with |V(H)|⩾|V(G)|. The bandwidth of G with respect to H is defined...
AbstractThe relationship between the graphical invariants bandwidth and number of edges is considere...
AbstractThe edge-bandwidth problem is an analog of the classical bandwidth problem, in which one has...
AbstractThe bandwidth of a graph G is the minimum of the maximum difference between adjacent labels ...
AbstractFor a given graph G and vertices u, ν in G let Gmssu(u, ν), Ga(u, ν), Gs(u, ν), Gc(u,ν) deno...
AbstractThe edge-bandwidth of a graph G is the smallest number B′ for which there is a bijective lab...
. The bandwidth of a graph G is the minimum of the maximum difference between adjacent labels when t...
This thesis presents a partial solution to the broad problem on bandwidths. The bandwidth problem f...
AbstractThe bandwidth B(G) of a finite simple graph G is the minimum of the quantity max{ƒ(x)-ƒ(y) :...
AbstractThe notion of cross-bandwidth is introduced, and it is shown that any graph that is suitably...
AbstractThe bandwidth of the Hamming graph (the product, (Kn)d, of complete graphs) has been an open...
Introduction Given an undirected graph G = (V; E) on n vertices, a linear arrangement (also called ...
The bandwidth of a graph is the minimum, over vertex labelings with distinct integers, of the maximu...
summary:In this paper, we improve the result by Harper on the lower bound of the bandwidth of connec...
AbstractWe give a general Harper-type lower bound for the bandwidth of a graph which is a common gen...
AbstractLet G,H be finite graphs with |V(H)|⩾|V(G)|. The bandwidth of G with respect to H is defined...
AbstractThe relationship between the graphical invariants bandwidth and number of edges is considere...
AbstractThe edge-bandwidth problem is an analog of the classical bandwidth problem, in which one has...
AbstractThe bandwidth of a graph G is the minimum of the maximum difference between adjacent labels ...
AbstractFor a given graph G and vertices u, ν in G let Gmssu(u, ν), Ga(u, ν), Gs(u, ν), Gc(u,ν) deno...
AbstractThe edge-bandwidth of a graph G is the smallest number B′ for which there is a bijective lab...
. The bandwidth of a graph G is the minimum of the maximum difference between adjacent labels when t...
This thesis presents a partial solution to the broad problem on bandwidths. The bandwidth problem f...
AbstractThe bandwidth B(G) of a finite simple graph G is the minimum of the quantity max{ƒ(x)-ƒ(y) :...
AbstractThe notion of cross-bandwidth is introduced, and it is shown that any graph that is suitably...
AbstractThe bandwidth of the Hamming graph (the product, (Kn)d, of complete graphs) has been an open...
Introduction Given an undirected graph G = (V; E) on n vertices, a linear arrangement (also called ...
The bandwidth of a graph is the minimum, over vertex labelings with distinct integers, of the maximu...
DOI
Add to ORKG