Loading [MathJax]/jax/output/CommonHTML/jax.js
World Scientific
Skip main navigation

Cookies Notification

We use cookies on this site to enhance your user experience. By continuing to browse the site, you consent to the use of our cookies. Learn More
×

System Upgrade on Tue, May 28th, 2024 at 2am (EDT)

Existing users will be able to log into the site and access content. However, E-commerce and registration of new users may not be available for up to 12 hours.
For online purchase, please visit us again. Contact us at customercare@wspc.com for any enquiries.

The characterization of lucky edge coloring in graphs

    https://doi.org/10.1142/S1793557123501280Cited by:0 (Source: Crossref)

    The lucky edge coloring of graph G is a proper edge coloring which is induced by a vertex coloring such that each edge is labeled by the sum of its vertices. The least integer k for which G has a lucky edge coloring in the set {1,2,,k} is called lucky number, denoted by η(G). The lucky numbers were already calculated for a large number of graphs, but not yet for trees. In this paper, we provide the characterization of lucky edge coloring and calculate the lucky number for graphs which can be regarded as complete m-ary trees.

    Communicated by I. Dimitrova

    AMSC: 05C05, 05C07, 05C15, 05C30