Some new odd-even congruence graphs

Authors

Keywords:

Labeling, Congruence labeling, Odd-even congruence labeling, triangular snake graph, ladder graph, coconut tree, triangular book, friendship graph.

Abstract

Introduction: The concept of labeling of graph has been introduced in mid-1960. A graph labeling is an assignment of integers to the nodes or edges or both depends on specific conditions. Many types of graph labeling techniques have been studied by several authors. 

Objectives: Labeling of graphs has remarkable applications in diverse fields like the study of the physical cosmology, debug circuit design, X-ray, crystallography, astronomy, radar, broadcasting network, secret sharing, database management, coding theory and much more. Besides these graph labeling techniques analyze and solve various graph related problems.

Methods: This research paper focuses on Odd-even congruence labeling of different types of graphs. Assignment of natural numbers as labels for the edges and vertices of a graph based on modular arithmetic property known as congruence graph labeling.For congruence graph labeling it entails the assignment of odd integers to vertices and even integers to edges with property of congruence graph labeling.

Results: This labeling method has been identified on triangular snake graph, ladder graph, coconut tree, triangular book, friendship graph. 

 

Downloads

Published

2024-09-15

How to Cite

Rituraj, & Shambhu Kumar Mishra. (2024). Some new odd-even congruence graphs. Journal of Computational Analysis and Applications (JoCAAA), 33(05), 334–341. Retrieved from https://eudoxuspress.com/index.php/pub/article/view/507

Issue

Section

Articles

Similar Articles

1 2 3 4 5 6 7 8 > >> 

You may also start an advanced similarity search for this article.