Add to ORKGThe bandwidth is an important invariant in graph theory. However, the problem to determine the bandwidth of a general graph is NP-complete. To get sharp bounds, we propose to pay attention to various duality properties or minimax relations related to the bandwidth problem. This paper presents a summary in this point of view
AbstractLet G,H be finite graphs with |V(H)|⩾|V(G)|. The bandwidth of G with respect to H is defined...
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...
This thesis presents a partial solution to the broad problem on bandwidths. The bandwidth problem f...
AbstractThe dual bandwidth of a graph, is the maximum value of the minimum labeling variance of any ...
The bandwidth of a graph is the minimum, over vertex labelings with distinct integers, of the maximu...
The bandwidth problem is the problem of numbering the vertices of a given graph G such that the max...
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...
The bandwidth problem is the problem of numbering the vertices of a given graph G such that the max...
The bandwidth problem deals with finding a labeling of a graph G using non-negative integers such th...
The bandwidth problem seeks for a simultaneous permutation of the rows and columns of the adjacency ...
summary:In this paper, we improve the result by Harper on the lower bound of the bandwidth of connec...
[[abstract]]A labeling of a graphy G with n vertices is a bijection from the vertex set of G to ｛1,2...
[[abstract]]A labeling of a graphy G with n vertices is a bijection from the vertex set of G to ｛1,2...
AbstractLet G,H be finite graphs with |V(H)|⩾|V(G)|. The bandwidth of G with respect to H is defined...
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...
This thesis presents a partial solution to the broad problem on bandwidths. The bandwidth problem f...
AbstractThe dual bandwidth of a graph, is the maximum value of the minimum labeling variance of any ...
The bandwidth of a graph is the minimum, over vertex labelings with distinct integers, of the maximu...
The bandwidth problem is the problem of numbering the vertices of a given graph G such that the max...
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...
The bandwidth problem is the problem of numbering the vertices of a given graph G such that the max...
The bandwidth problem deals with finding a labeling of a graph G using non-negative integers such th...
The bandwidth problem seeks for a simultaneous permutation of the rows and columns of the adjacency ...
summary:In this paper, we improve the result by Harper on the lower bound of the bandwidth of connec...
[[abstract]]A labeling of a graphy G with n vertices is a bijection from the vertex set of G to ｛1,2...
[[abstract]]A labeling of a graphy G with n vertices is a bijection from the vertex set of G to ｛1,2...
AbstractLet G,H be finite graphs with |V(H)|⩾|V(G)|. The bandwidth of G with respect to H is defined...
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...