No Detail Found!

Rainbow mean colorings of graphs

Author(s)
Gary Chartrand Department of Mathematics, Western Michigan University,Kalamazoo, Michigan 49008-5248,USA
James Hallas Department of Mathematics, Western Michigan University,Kalamazoo, Michigan 49008-5248,USA
Ebrahim Salehi Department of Mathematical Sciences, University of Nevada Las Vegas,Las Vegas, NV 89154-4020,USA
Ping Zhang Department of Mathematics, Western Michigan University,Kalamazoo, Michigan 49008-5248,USA
Abstract
A mean coloring of a connected graph G of order 3 or more is an edge coloring c of G with positive integers where the average of the colors of the edges incident with each vertex v of G is an integer. This average is the chromatic mean of v. If distinct vertices have distinct chromatic means, then c is called a rainbow mean coloring of G. The maximum vertex color in a rainbow mean coloring c of G is the rainbow chromatic mean index of c and the rainbow chromatic mean index of the graph G is the minimum chromatic mean index among all rainbow mean colorings of G. It is shown that the rainbow chromatic mean index exists for every connected graph of order 3 or more. The rainbow chromatic mean index is determined for paths, cycles, complete graphs, and stars.
Publication Details
Page(s) 18-25
DOI DOI not available
Published Journal: Discrete Mathematics Letters, Volume: 2, Issue: 0, Year: 2019

Request the full text from PASTIC

Keywords
rainbow chromatic mean index, rainbow mean colorings, chromatic mean
References
Chartrand G.,Gera S.,Hedetniemi C. .2016 .. Graph Theory-Favorite Conjectures and Open Problems, : .
Chartrand G.,Egan C.,Zhang P. .2019 .. , : .
Chartrand G.,Oellermann O. R. .1988 .How to define an irregular graph. , 19 : 36-42.
Chartrand G.,Jacobson M. S.,Lehel J.,Oellermann O. R.,Ruiz S.,Saba F. .1988 .. Congr. Numer, 64 : 197-210.
Chartrand G.,Zhang P.,Second Edition P. .2020 .. , : .
Wells D. .1988 .Which is the most beautiful?. Math. Intelligencer, 10 : 30-31.
0

Citations

0

Downloads

13

Views