Abstract
We have investigated some general classes of disconnected graceful graphs. We obtain the graceful labeling for $(P_{m} \times P_{n})~\bigcup~(P_{r} \times P_{s})$,~$C_{2f+3}~\bigcup~(P_{m} \times P_{n})~\bigcup~(P_{r} \times P_{s})$, where $ m,~n,~ r, ~s \in N - \{1\} $ and $f= 2(mn + rs) - (m + n + r + s)$. We also show that the tensor product of $P_{n}$ and $P_{3}$, where $n \in N - \{1,~2 \}$ admits graceful labeling. In addition to this we prove that a graph called star of cycle $C^{\star}_{n}$ is graceful, for $n \equiv 0$ (mod $4$).
Highlights
Introduction1.2 Definition A function f is called graceful labeling of a graph G = (V(G), E(G)) if f : V(G) −→ {0, 1, 2,
We begin with simple, undirected and finite graph G = (V(G), E(G)) with p vertices and q edges
We show that the tensor product of Pn and P3, where n ∈ N − {1, 2} admits graceful labeling
Summary
1.2 Definition A function f is called graceful labeling of a graph G = (V(G), E(G)) if f : V(G) −→ {0, 1, 2, . 1.4 Definition The Cartesian product of two paths Pn and Pm denoted as (Pn × Pm) is known as a grid graph on mn vertices. 1.5 Definition The tensor product of two graphs G1 and G2 denoted by G1(Tp)G2 has vertex set V(G1(Tp)G2) = V(G1) × V(G2) and the edge set E(G1(Tp)G2) = {((u1, v1), (u2, v2)) /u1u2 ∈ E(G1) and v1v2 ∈ E(G2)}. T + 2, t + 1, t − 1, which are in number 2rs + 1 − (r + s) We will use these labels for labeling of vertices of Pr × Ps, in which vertex labeling sequence is t −1, w−2, w−3, t +1, t +2, t + 3, w − 7, . F graceful labeling function and Pn(Tp)P3 is a graceful graph
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.