𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On the odd harmonious graphs with applications

✍ Scribed by Zhi-He Liang; Zhan-Li Bai

Book ID
107619751
Publisher
Springer-Verlag
Year
2008
Tongue
English
Weight
311 KB
Volume
29
Category
Article
ISSN
1598-5865

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

On the Harmonious Coloring of Graphs
On the Harmonious Coloring of Graphs
✍ Hopcroft, J. E.; Krishnamoorthy, M. S. πŸ“‚ Article πŸ“… 1983 πŸ› Society for Industrial and Applied Mathematics βš– 678 KB
On the harmonious coloring of collection
On the harmonious coloring of collections of graphs
✍ John P. Georges πŸ“‚ Article πŸ“… 1995 πŸ› John Wiley and Sons 🌐 English βš– 741 KB

## Abstract The hermonious coloring number of the graph __G, HC__(__G__), is the smallest number of colors needed to label the vertices of __G__ such that adjacent vertices received different colors and no two edges are incident with the same color pair. In this paper, we investigate the __HC__‐num

On the harmonious chromatic number of a
On the harmonious chromatic number of a graph
✍ John Mitchem πŸ“‚ Article πŸ“… 1989 πŸ› Elsevier Science 🌐 English βš– 755 KB

The harmonious chromatic number of a graph G, denoted by h(G), is the least number of colon which can be assigned to the vertices of G such that adjacent vertices are colored differently and any two distinct edges have different color pairs. This is a slight variation of a definition given independe

On the -optimality in graphs with odd gi
On the -optimality in graphs with odd girth and even girth
✍ C. Balbuena; P. GarcΓ­a-VΓ‘zquez; L.P. Montejano; J. Salas πŸ“‚ Article πŸ“… 2011 πŸ› Elsevier Science 🌐 English βš– 222 KB

## a b s t r a c t For a connected graph G, the restricted edge-connectivity Ξ» β€² (G) is defined as the minimum cardinality of an edge-cut over all edge-cuts S such that there are no isolated vertices in }, d(u) denoting the degree of a vertex u. The main result of this paper is that graphs with od