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
This paper is a study on the bandwidth of tower graphs Tm,2 and bounds for the bandwidth of tower gr...
The bandwidth problem is the problem of numbering the vertices of a given graph G such that the max...
AbstractWe give a general Harper-type lower bound for the bandwidth of a graph which is a common gen...
summary:In this paper, we improve the result by Harper on the lower bound of the bandwidth of connec...
AbstractThe relationship between the graphical invariants bandwidth and number of edges is considere...
The relationship between the graphical invariants bandwidth and number of edges is considered. Bound...
This thesis presents a partial solution to the broad problem on bandwidths. The bandwidth problem f...
The bandwidth is an important invariant in graph theory. However, the problem to determine the bandw...
The bandwidth of a graph is the minimum, over vertex labelings with distinct integers, of the maximu...
AbstractLet G,H be finite graphs with |V(H)|⩾|V(G)|. The bandwidth of G with respect to H is defined...
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...
The bandwidth problem seeks for a simultaneous permutation of the rows and columns of the adjacency ...
AbstractFor a given graph G and vertices u, ν in G let Gmssu(u, ν), Ga(u, ν), Gs(u, ν), Gc(u,ν) deno...
The bandwidth problem deals with finding a labeling of a graph G using non-negative integers such th...
This paper is a study on the bandwidth of tower graphs Tm,2 and bounds for the bandwidth of tower gr...
The bandwidth problem is the problem of numbering the vertices of a given graph G such that the max...
AbstractWe give a general Harper-type lower bound for the bandwidth of a graph which is a common gen...
summary:In this paper, we improve the result by Harper on the lower bound of the bandwidth of connec...
AbstractThe relationship between the graphical invariants bandwidth and number of edges is considere...
The relationship between the graphical invariants bandwidth and number of edges is considered. Bound...
This thesis presents a partial solution to the broad problem on bandwidths. The bandwidth problem f...
The bandwidth is an important invariant in graph theory. However, the problem to determine the bandw...
The bandwidth of a graph is the minimum, over vertex labelings with distinct integers, of the maximu...
AbstractLet G,H be finite graphs with |V(H)|⩾|V(G)|. The bandwidth of G with respect to H is defined...
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...
The bandwidth problem seeks for a simultaneous permutation of the rows and columns of the adjacency ...
AbstractFor a given graph G and vertices u, ν in G let Gmssu(u, ν), Ga(u, ν), Gs(u, ν), Gc(u,ν) deno...
The bandwidth problem deals with finding a labeling of a graph G using non-negative integers such th...
This paper is a study on the bandwidth of tower graphs Tm,2 and bounds for the bandwidth of tower gr...
The bandwidth problem is the problem of numbering the vertices of a given graph G such that the max...
AbstractWe give a general Harper-type lower bound for the bandwidth of a graph which is a common gen...
DOI
Add to ORKG