✦ LIBER ✦

Chromatic difference sequences and homomorphisms

✍ Scribed by Huishan Zhou

Publisher: Elsevier Science
Year: 1993
Tongue: English
Weight: 730 KB
Volume: 113
Category: Article
ISSN: 0012-365X
DOI: 10.1016/0012-365x(93)90527-z

No coin nor oath required. For personal study only.

✦ Synopsis

This note characterizes graphs with the second term of their chitimatic diherence seq-uences equal t-o& *d gives a r! 2% of graphs, called Isi',, that are determined by their chromatic difference sequences. It also gives a large class of n-chromatic graphs for which \V, is a homomorphic image. It is proved that the normalized chromatic difference sequence of the categorical product G x H dominate5 the normalized chromatic difference sequence of G and of H.

📜 SIMILAR VOLUMES

The chromatic difference sequence of a g

The chromatic difference sequence of a graph

✍ Michael O Albertson; David M Berman 📂 Article 📅 1980 🏛 Elsevier Science 🌐 English ⚖ 713 KB

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

Hadwiger number and chromatic number for

Hadwiger number and chromatic number for near regular degree sequences

✍ Neil Robertson; Zi-Xia Song 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 105 KB

## Abstract We consider a problem related to Hadwiger's Conjecture. Let __D__=(__d__~1~, __d__~2~, …, __d__~__n__~) be a graphic sequence with 0⩽__d__~1~⩽__d__~2~⩽···⩽__d__~__n__~⩽__n__−1. Any simple graph __G__ with __D__ its degree sequence is called a realization of __D__. Let __R__[__D__] denot

Mitochondrial leader sequences: Structur

Mitochondrial leader sequences: Structural similarities and sequence differences

✍ Hammen, Philip K.; Weiner, Henry 📂 Article 📅 1998 🏛 John Wiley and Sons 🌐 English ⚖ 64 KB

While having essentially no amino acid sequence homology, the mitochondrial leader sequences of different pre-proteins carry out the same function of targeting the protein to mitochondria. Among the common attributes that have been noted for leader sequences are a net positive charge and the ability

Isolation of osteosarcoma-associated amp

Isolation of osteosarcoma-associated amplified DNA sequences using representational difference analysis

✍ Annet Simons; Irene M. Janssen; Ron F. Suijkerbuijk; René P.H. Veth; Maciej Prus 📂 Article 📅 1997 🏛 John Wiley and Sons 🌐 English ⚖ 134 KB

Comparative genomic hybridization analysis of a primary osteosarcoma and its metastasis revealed two regions of DNA amplification, one at 17p11.2-12 and one at 19q12-13. Subsequent representational difference analysis of the primary tumor resulted in the isolation of two distinct tumor-amplified DNA