Semi-cartesian product of graphs |
| |
Authors: | Metrose Metsidik |
| |
Institution: | 1. School of Mathematical Sciences, Xiamen University, Xiamen?, 361005, People’s Republic of China 2. College of Mathematical Sciences, Xinjiang Normal University, ürümqi?, 830054, People’s Republic of China
|
| |
Abstract: | In this paper, we define a kind of new product graphs with hexagonal inner faces, called semi-cartesian products, so that they directly link with hexagonal system, e.g., the semi-cartesian product of an even cycle and a path is a zigzag polyhex nanotube, a path and an even cycle is an armchair polyhex nanotube, two even cycles is a polyhex nanotorus and two paths is a polyhex lattice. Then we consider the distance in a semi-cartesian product and show two formulas to calculate the distance of two vertices and the sum of all pair of distances. Moreover we illustrate that the applying of the semi-cartesian products would be greatly simplifies the calculation of the distances in the carbon nanotubes and polyhex nanotorus by presenting some examples. |
| |
Keywords: | |
本文献已被 SpringerLink 等数据库收录! |
|