𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On σ-polynomials

✍ Scribed by Shao-Ji Xu

Publisher
Elsevier Science
Year
1988
Tongue
English
Weight
612 KB
Volume
69
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

✦ Synopsis

In this paper, the properties of o-poiynirnuals and quadratic a-polynomials are discussed. An alternative characterization for a quadratic a-Flynomial to be a u-polynomial of a graph is given. The number of graphs having same quadratic o-polynomial CT* + au + b and the number of quadratic u-polynomials of graphs if a is fixed are given. The ineqwality b s $(a' -5a + 12) which was conjectured in [l] and proved in [4] is improved.

📜 SIMILAR VOLUMES

A note on quadratic σ-polynomials
A note on quadratic σ-polynomials
✍ Robert R. Korfhage 📂 Article 📅 1988 🏛 Elsevier Science 🌐 English ⚖ 142 KB

A huer delineation of quadratic u-polynomials than has been previously published is given.

On σ-polynomials and a class of chromati
On σ-polynomials and a class of chromatically unique graphs
✍ Qingyan Du 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 655 KB

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, thi

Maximal σ-polynomials of connected 3-chr
Maximal σ-polynomials of connected 3-chromatic graphs
✍ Ioan Tomescu 📂 Article 📅 2003 🏛 John Wiley and Sons 🌐 English ⚖ 113 KB 👁 1 views

## Abstract In the set of graphs of order __n__ and chromatic number __k__ the following partial order relation is defined. One says that a graph __G__ is less than a graph __H__ if __c__~__i__~(__G__) ≤ __c__~__i__~(__H__) holds for every __i__, __k__ ≤ __i__ ≤ __n__ and at least one inequality is

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.