𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On σ-polynomials and a class of chromatically unique graphs

✍ Scribed by Qingyan Du

Publisher
Elsevier Science
Year
1993
Tongue
English
Weight
655 KB
Volume
115
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

✦ Synopsis

Du, Q., On o-polynomials and a class of chromatically unique graphs, Discrete Mathematics 115 (1993) 153-165. Let cr(G)=C:,,aicr '-' be the u-polynomial of a graph G. We ask the question: When k and a, are given, what is the largest possible value of ai(O < i < k) for any graph G? In this paper, this question is answered and the extremal graphs are characterized.

So, the results in are generalized.

📜 SIMILAR VOLUMES

Classification of chromatically unique g
Classification of chromatically unique graphs having quadratic σ-polynomials
✍ Nian-Zu Li; Earl Glen Whitehead Jr.; Shao-Ji Xu 📂 Article 📅 1987 🏛 John Wiley and Sons 🌐 English ⚖ 329 KB 👁 1 views

Frucht and Giudici classified all graphs having quadratic a-polynomials. Here w e classify all chromatically unique graphs having quadratic (Tpolynomials.

On the join of graphs and chromatic uniq
On the join of graphs and chromatic uniqueness
✍ G. L. Chia 📂 Article 📅 1995 🏛 John Wiley and Sons 🌐 English ⚖ 519 KB

## Abstract A graph is chromatically unique if it is uniquely determined by its chromatic polynomial. Let __G__ be a chromatically unique graph and let __K__~__m__~ denote the complete graph on __m__ vertices. This paper is mainly concerned with the chromaticity of __K__~__m__~ + __G__ where + deno

On the chromatic equivalence class of a
On the chromatic equivalence class of a family of graphs
✍ G.L. Chia 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 196 KB

Let P\* denote the graph obtained by joining a new vertex to every vertex of a path on n vertices. Let Ui,j(n) denote the set of all connected graphs obtained from PfwP\* by connecting the four vertices of degree 2 by two paths of lengths s( 1> 0) and t( ~> 1) such that s + t = n -i -j is a constant

Note on Choudum's “chromatic bounds for
Note on Choudum's “chromatic bounds for a class of graphs”
✍ Medha Javdekar 📂 Article 📅 1980 🏛 John Wiley and Sons 🌐 English ⚖ 105 KB

## Abstract If a graph __G__ has no induced subgraph isomorphic to __K__~1,3′~ __K__~5~‐__e__, or a third graph that can be selected from two specific graphs, then the chromatic number of __G__ is either __d__ or __d__ + 1, where __d__ is the maximum order of a clique in __G__.

The number of shortest cycles and the ch
The number of shortest cycles and the chromatic uniqueness of a graph
✍ C. P. Teo; K. M. Koh 📂 Article 📅 1992 🏛 John Wiley and Sons 🌐 English ⚖ 403 KB 👁 2 views

## Abstract For a graph __G__, let __g__(__G__) and σ~g~(__G__) denote, respectively, the girth of __G__ and the number of cycles of length __g__(__G__) in __G__. In this paper, we first obtain an upper bound for σ~g~(__G__) and determine the structure of a 2‐connected graph __G__ when σ~g~(__G__)