In this paper, We define Quotient Remainder Labeling. We investigate any path (n is even) is a quotient remainder graph when n≤9. We prove K1,n is a quotient remainder graph, any comb is a quotient remainder graph if 4≤n≤7. We prove that any rooted tree is quotient remainder graph, Bistar Bm,n is a quotient remainder graph if │m+n│≤14. Also, we prove that the wheel W3is a quotient remainder graph and cycle Cn(n is odd) is a quotient remainder graph if n≤9.Also we introduced a technique of coding and decoding a message by using Quotient Remainder Labeling.
Volume 11 | 03-Special Issue
Pages: 1471-1479