A lower bound and several exact results on the d-lucky number

DOI10.1016/J.AMC.2019.124760MaRDI QIDQ2284776zbMATH OpenOpenAlexWikidataFDO

Authors Sandi Klavžar, Indra Rajasingh, D. Ahima Emilet

Publication date 15 January 2020

Published in Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1903.07863

zbMATH Keywords

\(d\)-lucky labelingcocktail-party graphscorona graphslucky labeling

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Abstract: If $ell:V(G)ightarrowmathbbN$ is a vertex labeling of a graph $G=(V(G),E(G))$, then the $d$-lucky sum of a vertex $uinV(G)$ is $d_{e}ll(u)=d_G(u)+su{m}_{vinN(u)}ell(v)$. The labeling $ell$ is a $d$-lucky labeling if $d_{e}ll(u)eq{d}_{e}ll(v)$ for every $uvinE(G)$. The $d$-lucky number $et{a}_{dl}(G)$ of $G$ is the least positive integer $k$ such that $G$ has a $d$-lucky labeling $V(G)ightarrow[k]$. A general lower bound on the $d$-lucky number of a graph in terms of its clique number and related degree invariants is proved. The bound is sharp as demonstrated with an infinite family of corona graphs. The $d$-lucky number is also determined for the so-called $G_{n,m}$-web graphs and graphs obtained by attaching the same number of pendant vertices to the vertices of a generalized cocktail-party graph.

Recommendations

• Lucky labelings of graphs
• e-lucky labeling of certain graphs
• On the lucky choice number of graphs
• Computation of lucky number of planar graphs is NP-hard
• On \(L(d,1)\)-labelings of graphs

Cites work

• \(L(2, 1)\)-labeling of circulant graphs
• A note on a directed version of the 1-2-3 conjecture
• A note on adjacent vertex distinguishing colorings of graphs
• Algorithmic complexity of proper labeling problems
• Antimagic labelings of caterpillars
• Computation of lucky number of planar graphs is NP-hard
• Edge weights and vertex colours
• Even complete supersubdivision of any graph is cordial
• Generalized edge-magic total labellings of models from researching networks
• Generalized line graphs
• Lucky labelings of graphs
• On H-antimagicness of Cartesian product of graphs
• On the algorithmic complexity of adjacent vertex closed distinguishing colorings number of graphs
• On the lucky choice number of graphs
• Product cordial labeling of double wheel and double fan related graphs
• The 1-2-3-conjecture for hypergraphs
• The \((d, 1)\)-total labelling of Sierpiński-like graphs
• The sigma chromatic number of a graph
• Topics in graph theory. Graphs and their Cartesian product
• Weighted antimagic labeling

Cited in

(4)

• On the lucky choice number of graphs
• Computation of lucky number of planar graphs is NP-hard
• e-lucky labeling of certain graphs
• Lucky labelings of graphs

This page was built for publication: A lower bound and several exact results on the \(d\)-lucky number

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2284776)