𝔖 Bobbio Scriptorium
✦   LIBER   ✦

b-Chromatic Number of Cartesian Product of Some Families of Graphs

✍ Scribed by R. Balakrishnan, S. Francis Raj, T. Kavaskar

Book ID
120788824
Publisher
Springer Japan
Year
2013
Tongue
English
Weight
346 KB
Volume
30
Category
Article
ISSN
0911-0119

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

The binding numbers of some Cartesian pr
The binding numbers of some Cartesian products of graphs
✍ Danuta Michalak πŸ“‚ Article πŸ“… 1994 πŸ› Elsevier Science 🌐 English βš– 238 KB

In the paper we obtain some conditions under which the binding number bind (C) of a Cartesian product graph G is equal to The concept of the binding number of a graph was introduced by Woodall in 1973 . The main theorem of Woodall's paper is a sufficient condition for the existence of a Hamiltonian

Circular chromatic index of Cartesian pr
Circular chromatic index of Cartesian products of graphs
✍ Douglas B. West; Xuding Zhu πŸ“‚ Article πŸ“… 2007 πŸ› John Wiley and Sons 🌐 English βš– 164 KB

## Abstract The __circular chromatic index__ of a graph __G__, written $\chi\_{c}'(G)$, is the minimum __r__ permitting a function $f : E(G)\rightarrow [0,r)$ such that $1 \le | f(e)-f(e')|\le r - 1$ whenever __e__ and $e'$ are incident. Let $G = H$ β–‘ $C\_{2m +1}$, where β–‘ denotes Cartesian product

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