๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Graph products and the chromatic difference sequence of vertex-transitive graphs

โœ Scribed by Claude Tardif

Book ID
108316181
Publisher
Elsevier Science
Year
1998
Tongue
English
Weight
386 KB
Volume
185
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

The chromatic difference sequence of the
The chromatic difference sequence of the Cartesian product of graphs
โœ Huishan Zhou ๐Ÿ“‚ Article ๐Ÿ“… 1991 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 953 KB

Zhou, H., The chromatic difference sequence of the Cartesian product of graphs, Discrete Mathematics 90 (1991) 297-311. The chromatic difference sequence cds(G) of a graph G with chromatic number n is defined by cds(G) = (a(l), a(2), . . , a(n)) if the sum of a(l), a(2), . , a(t) is the maximum numb

On the ultimate normalized chromatic dif
On the ultimate normalized chromatic difference sequence of a graph
โœ Huishan Zhou ๐Ÿ“‚ Article ๐Ÿ“… 1996 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 489 KB

For graphs G and H, the Cartesian product G ร— H is defined as follows: the vertex set is ## V(G) ร— V(H), and two vertices (g,h) and (9',h') are adjacent in G ร— H if either g = g' and hh' E E(H) or h = h' and g9' E E(G). Let G k denote the Cartesian product of k copies of G. The chromatic differen