𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A New Upper Bound for the Irregularity Strength of Graphs

✍ Scribed by Kalkowski, M.; Karoński, M.; Pfender, F.

Book ID
118197840
Publisher
Society for Industrial and Applied Mathematics
Year
2011
Tongue
English
Weight
73 KB
Volume
25
Category
Article
ISSN
0895-4801

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A new upper bound for total colourings o
A new upper bound for total colourings of graphs
✍ Abdón Sánchez-Arroyo 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 118 KB

We give a new upper bound on the total chromatic number of a graph. This bound improves the results known for some classes of graphs. The bound is stated as follows: ZT ~< Z~ + L l3 ~ J + 2, where Z is the chromatic number, Z~ is the edge chromatic number (chromatic index) and ZT is the total chroma