• Proceedings of the KIEE Conference
• /
• 1987.07b
• /
• pp.1543-1546
• /
• 1987

In this paper, we give an overview of harmonious graphs and graceful graphs, identify the simply sequential and survey graceful graphs of wheels. Finally, we describe B-valuation of wheels which Can be used in graceful numbering.

• Journal of applied mathematics & informatics
• /
• v.34 no.1_2
• /
• pp.9-17
• /
• 2016

In this paper, it has been shown that the hairy cycle C_n ⊙ rK₁, n ≡ 3(mod4), the graph obtained by adding pendant edge to each pendant vertex of hairy cycle C_n ⊙ 1K₁, n ≡ 0(mod4), double graph of path P_n and double graph of comb P_n ⊙ 1K₁ are k-graceful.

• Journal of applied mathematics & informatics
• /
• v.30 no.5_6
• /
• pp.913-923
• /
• 2012

The Odd-Even graceful labeling of a graph G with $q$ edges means that there is an injection $f:V (G)$ to $\{1,3,5,{\cdots},2q+1\}$ such that, when each edge $uv$ is assigned the label ${\mid}f(u)-f(v){\mid}$, the resulting edge labels are $\{2,4,6,{\cdots},2q\}$. A graph which admits an odd-even graceful labeling is called an odd-even graceful graph. In this paper, we prove that some well known graphs namely $P_n$, $P_n^+$, $K_{1,n}$, $K_{1,2,n}$, $K_{m,n}$, $B_{m,n}$ are Odd-Even graceful.

• Journal of applied mathematics & informatics
• /
• v.35 no.1_2
• /
• pp.59-74
• /
• 2017

A radio labeling of a graph G is a function $f:V(G){\rightarrow}\{1,2,{\ldots},k\}$ with the property that ${\mid}f(u)-f(v){\mid}{\geq}1+diam(G)-d(u,v)$ for every pair of vertices $u,v{\in}V(G)$, where diam(G) and d(u, v) are diameter and distance between u and v in the graph G respectively. The radio number of a graph G, denoted by rn(G), is the smallest integer k such that G admits a radio labeling. In this paper, we completely determine radio number of all transformation graphs of a path.