The chromatic difference sequence of the Cartesian product of graphs
نویسندگان
چکیده
منابع مشابه
The chromatic difference sequence of the Cartesian product of graphs
Zhou, H., The chromatic difference sequence of the Cartesian product of graphs: Part II, Discrete Applied Mathematics 41 (1993) 263-267. This paper is a continuation of our earlier paper under the same title. We prove that the normalized chromatic difference sequences of the Cartesian powers of a Cayley graph on a finite Abelian group are stable; and that if the chromatic difference sequence of...
متن کاملThe reliability Wiener number of cartesian product graphs
Reliability Wiener number is a modification of the original Wiener number in which probabilities are assigned to edges yielding a natural model in which there are some (or all) bonds in the molecule that are not static. Various probabilities naturally allow modelling different types of chemical bonds because chemical bonds are of different types and it is well-known that under certain condition...
متن کاملGame Chromatic Number of Cartesian Product Graphs
The game chromatic number χg is considered for the Cartesian product G 2 H of two graphs G and H. We determine exact values of χg(G2H) when G and H belong to certain classes of graphs, and show that, in general, the game chromatic number χg(G2H) is not bounded from above by a function of game chromatic numbers of graphs G and H. An analogous result is proved for the game coloring number colg(G2...
متن کاملK-tuple Chromatic Number of the Cartesian Product of Graphs
A k-tuple coloring of a graph G assigns a set of k colors to each vertex of G such that if two vertices are adjacent, the corresponding sets of colors are disjoint. The k-tuple chromatic number of G, χk(G), is the smallest t so that there is a k-tuple coloring of G using t colors. It is well known that χ(G2H) = max{χ(G), χ(H)}. In this paper, we show that there exist graphs G and H such that χk...
متن کاملAcyclic chromatic index of Cartesian product of graphs
A proper edge colouring of a graph is said to be acyclic if every cycle of G receives at least three colors. The acyclic chromatic index, denoted , is the least number of colors required for an acyclic edge color of . This paper shows an upper bound of the acyclic chromatic index of a class of graphs which can be expressed as the Cartesian product of some graphs. We also give exact values for s...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 1991
ISSN: 0012-365X
DOI: 10.1016/0012-365x(91)90150-z