On bandwidth for the tensor product of paths and cycles
type: Item
instance of: scholarly article
title: On bandwidth for the tensor product of paths and cycles
zbMATH Open document ID: 0869.05056
DOI: 10.1016/S0166-218X(95)00005-C
author: Yung-Ling Lai
author: Kenneth L. Williams
published in: Discrete Applied Mathematics
publication date: 1997-08-14T00:00:00Z
full work available at URL: dam
review text: The tensor product of graphs \(G_1\) and \(G_2\), denoted by \(G_1(T_P)G_2\), is the graph which has vertex set \(V(G_1) \times V(G_2)\) and edges defined by: \((x_1,y_1)\) is adjacent to \((x_2,y_2)\) when \((x_1,x_2) \in E(G_1)\) and \((y_1,y_2) \in E(G_2)\). The authors obtain the bandwidth and provide an optimal numbering with this bandwidth for the following tensor products: path and path, path and cycle, cycle and cycle.
Mathematics Subject Classification ID: 05C78
Mathematics Subject Classification ID: 05C38
zbMATH DE Number: 1004435
zbMATH Keywords: bandwidth
zbMATH Keywords: tensor product
reviewed by: Norman F. Quimpo
MaRDI profile type: Publication
cites work: Q4147995
cites work: The bandwidth problem for graphs and matrices—a survey
cites work: Q3139862
cites work: Q4842753
cites work: A remark on a problem of Harary
cites work: Optimal labelling of a product of two paths
cites work: Complexity Results for Bandwidth Minimization
cites work: Optimal numberings and isoperimetric problems on graphs
cites work: Q4305531
cites work: The Categorical Product of Graphs
cites work: The NP-completeness of the bandwidth minimization problem
cites work: The Kronecker Product of Graphs
Wikidata QID: Q127809402
OpenAlex ID: W2027606473
description: scientific article; zbMATH DE number 1004435