The bandwidth of a graph is the minimum of the maximum difference between labels of adjacent vertices in the graph. if we label the edges instead of the vertices of the graph, we can define the edge-bandwidth accordingly. people start working on the edge-bandwidth of graphs since 1999[7]. the edge-bandwidth of a graph is the minimum of the maximum difference between labels of adjacent edges in the graph. since the edge-bandwidth of a graph G is equal to the bandwidth of adjacent edges in the graph. since the edge-bandwidth of a graph G is equal to the bandwidth of the line graph of G, establishing the edge-bandwidth of a graph is equivalent to verifying the bandwidth of one or more graphs. the decision problem corresponding to find the bandwidth of an arbitrary graph is NP-complete[10]. it is NP-complete even for tress of maximum degree 3[6]. although the edge-bandwidth problem is included in the bandwidth problem, the computing complexity of the edge-bandwidth is unknown up to now. the application about the edge-bandwidth problem has been solved for only a few classes of graphs such as complete graph, complete bipartite graph with equal partitites, caterpillar and theta graph[5]. this paper establishes the edge-bandwidth of the tensor product of a path whith a path and a path with a cycle. optimal edge-numberings to achieve each of these edge-bandwidths are provided