DOIAbstract
AbstractThe relationship between the graphical invariants bandwidth and number of edges is considered. Bounds, some sharp and others improvements of known results, are given for the number of edges of graphs having a given bandwidth
AbstractThe relationship between the graphical invariants bandwidth and number of edges is considered. Bounds, some sharp and others improvements of known results, are given for the number of edges of graphs having a given bandwidth
AbstractWe give a polynomial time algorithm to compute the bandwidth of a (q,q−4)-graph for each con...
This paper is a study on the bandwidth of tower graphs Tm,2 and bounds for the bandwidth of tower gr...
AbstractLet G,H be finite graphs with |V(H)|⩾|V(G)|. The bandwidth of G with respect to H is defined...
The relationship between the graphical invariants bandwidth and number of edges is considered. Bound...
AbstractThe relationship between the graphical invariants bandwidth and number of edges is considere...
This thesis presents a partial solution to the broad problem on bandwidths. The bandwidth problem f...
Abstract. The edge-bandwidth of a graph G is the bandwidth of the line graph of G. We show asymptoti...
The edge-bandwidth problem is an analog of the classical bandwidth problem, in which one has to labe...
AbstractThe edge-bandwidth problem is an analog of the classical bandwidth problem, in which one has...
The bandwidth is an important invariant in graph theory. However, the problem to determine the bandw...
AbstractFor a given graph G and vertices u, ν in G let Gmssu(u, ν), Ga(u, ν), Gs(u, ν), Gc(u,ν) deno...
summary:In this paper, we improve the result by Harper on the lower bound of the bandwidth of connec...
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...
The bandwidth problem is the problem of numbering the vertices of a given graph G such that the max...
AbstractWe give a polynomial time algorithm to compute the bandwidth of a (q,q−4)-graph for each con...
This paper is a study on the bandwidth of tower graphs Tm,2 and bounds for the bandwidth of tower gr...
AbstractLet G,H be finite graphs with |V(H)|⩾|V(G)|. The bandwidth of G with respect to H is defined...
The relationship between the graphical invariants bandwidth and number of edges is considered. Bound...
AbstractThe relationship between the graphical invariants bandwidth and number of edges is considere...
This thesis presents a partial solution to the broad problem on bandwidths. The bandwidth problem f...
Abstract. The edge-bandwidth of a graph G is the bandwidth of the line graph of G. We show asymptoti...
The edge-bandwidth problem is an analog of the classical bandwidth problem, in which one has to labe...
AbstractThe edge-bandwidth problem is an analog of the classical bandwidth problem, in which one has...
The bandwidth is an important invariant in graph theory. However, the problem to determine the bandw...
AbstractFor a given graph G and vertices u, ν in G let Gmssu(u, ν), Ga(u, ν), Gs(u, ν), Gc(u,ν) deno...
summary:In this paper, we improve the result by Harper on the lower bound of the bandwidth of connec...
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...
The bandwidth problem is the problem of numbering the vertices of a given graph G such that the max...
AbstractWe give a polynomial time algorithm to compute the bandwidth of a (q,q−4)-graph for each con...
This paper is a study on the bandwidth of tower graphs Tm,2 and bounds for the bandwidth of tower gr...
AbstractLet G,H be finite graphs with |V(H)|⩾|V(G)|. The bandwidth of G with respect to H is defined...
Add to ORKG