Abstract

If the vertex set V of G = can be divided into two un empty sets X and Y, X ∪ Y = V,X ∩ Y = ∅, but also two nodes of every edge belong to X and Y separately, the G is called bipartite graph. If ∀ x i ∈ X, y i ∈ Y, (x i , y i ) ∈ E then G is called complete bipartite graph. if ∣ X ∣ = m,∣ Y ∣ = n, the G is marked K m,n . In this paper the graceful labeling, k-graceful labeling, odd graceful labeling and odd strongly harmonious labeling are given.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

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.