The beta-number, β (G), of a graph G is defined to be either the smallest positive integer n for which there exists an injective function f : V (G) → {0, 1,. .. , n} such that each uv ∈ E (G) is labeled |f (u) − f (v)| and the resulting set of edge labels is {c, c + 1,. .. , c + |E (G)| − 1} for some positive integer c or +∞ if there exists no such integer n. If c = 1, then the resulting beta-number is called the strong beta-number of G and is denoted by β s (G). In this paper, we show that if G is a bipartite graph and m is odd, then β (mG) ≤ mβ (G) + m − 1. This leads us to conclude that β (mG) = m |V (G)| − 1 if G has the additional property that G is a graceful nontrivial Full PDF DMGT Page tree. In addition to these, we examine the (strong) beta-number of forests whose components are isomorphic to either paths or stars.
In this paper, we find the harmonious chromatic number of the corona product of any graph G of order l with the complete graph K n for l n. As a consequence of this work, we also obtain the harmonious chromatic number of t copies of K n for t n þ 1.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.