ABSTRACT
Let πΊ = (π(πΊ),πΈ(πΊ)) be a graph. Let β:π(πΊ)βπ3 be a function. For each edge π₯π¦ assign the label r where r is the remainder when 0(β(π₯)) is divided by π(β(π¦)) or π(β(π¦)) is divided by π(β(π₯)) according as π(β(π₯)) β₯ π(β(π¦)) or π(β(π¦)) β₯ π(β(π₯)). The function h is called a group π3 cordial remainder labeling of πΊ if |π£β(π) β π£β(π)| β€ 1 and |πβ(1) β πβ(0)| β€ 1, where π£β(π) denotes the number of vertices labeled with j and π£β(π) denotes the number of edges labeled with π (π = 0,1). A graph πΊ which admits a group π3 cordial remainder labeling is called a group π3 cordial remainder labeling is called a group π3 cordial remainder graph. In this paper, we
References
Support the magazine and subscribe to the content
This is premium stuff. Subscribe to read the entire article.
