𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Graphs connected to the hadamard manifold and groups of its isometries

✍ Scribed by S. V. Buyalo

Publisher
Springer US
Year
1994
Tongue
English
Weight
780 KB
Volume
69
Category
Article
ISSN
1573-8795

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

The rainbow connection of a graph is (at
The rainbow connection of a graph is (at most) reciprocal to its minimum degree
✍ Michael Krivelevich; Raphael Yuster πŸ“‚ Article πŸ“… 2009 πŸ› John Wiley and Sons 🌐 English βš– 83 KB πŸ‘ 1 views

## Abstract An edge‐colored graph __G__is __rainbow edge‐connected__ if any two vertices are connected by a path whose edges have distinct colors. The __rainbow connection__ of a connected graph __G__, denoted by __rc__(__G__), is the smallest number of colors that are needed in order to make __G__

The 3-connectivity of a graph and the mu
The 3-connectivity of a graph and the multiplicity of zero β€œ2” of its chromatic polynomial
✍ F. M. Dong; K. M. Koh πŸ“‚ Article πŸ“… 2011 πŸ› John Wiley and Sons 🌐 English βš– 691 KB

Let G be a graph of order n, maximum degree , and minimum degree . Let P(G, ) be the chromatic polynomial of G. It is known that the multiplicity of zero "0" of P(G, ) is one if G is connected, and the multiplicity of zero "1" of P(G, ) is one if G is 2-connected. Is the multiplicity of zero "2" of