𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A Wiener-type graph invariant for some bipartite graphs

✍ Scribed by A.A. Dobrynin; I. Gutman; G. Dömötör

Publisher
Elsevier Science
Year
1995
Tongue
English
Weight
297 KB
Volume
8
Category
Article
ISSN
0893-9659

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A sufficient condition for bipartite gra
A sufficient condition for bipartite graphs to be type one
✍ Xu, Baogang 📂 Article 📅 1998 🏛 John Wiley and Sons 🌐 English ⚖ 58 KB 👁 2 views

The total chromatic number χ T (G) of graph G is the least number of colors assigned to V (G) ∪ E(G) such that no adjacent or incident elements receive the same color. In this article, we give a sufficient condition for a bipartite graph G to have χ T (G) = ∆(G) + 1.