No Detail Found!

A note on the proper mean indexes of subdivided stars

Author(s)
James Hallas Department of Mathematics, Western Michigan University,Kalamazoo, Michigan 49008-5248,USA
Ping Zhang Department of Mathematics, Western Michigan University,Kalamazoo, Michigan 49008-5248,USA
Abstract
For an edge coloring c of a connected graph G of order 3 or more with positive integers, the chromatic mean of a vertex v of G is the sum of the colors of the edges incident with v divided by the degree of v. If the chromatic mean of every vertex of G is a positive integer, then c is a mean coloring of G. If adjacent vertices have distinct chromatic means, then c is a proper mean coloring of G. The maximum vertex color in a proper mean coloring c of G is the proper mean index of c and the proper mean index of G is the minimum proper mean index among all proper mean colorings of G. It is conjectured that the proper mean index of every tree of order 3 or more is either 3 or 4. In this note, we verify this conjecture for all trees having exactly one vertex of degree 3 or more, that is, trees that are obtained by subdividing the edges of a star of order 4 or more and characterize those subdivided stars having proper mean index 3 (equivalently 4).
Publication Details
Page(s) 19-24
DOI DOI not available
Published Journal: Discrete Mathematics Letters, Volume: 3, Issue: 0, Year: 2020

Request the full text from PASTIC

Keywords
subdivided stars, proper mean colorings, proper mean index
References
Chartrand G.,Hallas J.,Zhang P.,Chartrand G.,Hallas J.,Zhang P.,Chartrand G.,Zhang P.,Second Edition P. .2020 .. Discrete Math. Lett. 3, (2020) : 1-8.
0

Citations

0

Downloads

15

Views