2-ODD labeling of graphs using some graph operations
Künye
Pir, A. A., Parthiban, A. & Singh, K. (2024). 2-ODD labeling of graphs using some graph operations. TWMS Journal Of Applied And Engineering Mathematics, 14(2), 719-729.Özet
2-odd labeling assigns distinct integers to the nodes of a graph G(V, E) in such a manner, that the positive difference of adjacent nodes is either 2 or an odd integer, 2k ± 1, k ? N. So, G is a 2-odd graph if and only if it permits 2-odd labeling. It is interesting and challenging to study certain important modifications through various graph operations on a given graph. These operations mainly modify the structure of the underlying graph and so having some understanding of the complex operations which can be done over a graph or a set of graphs is inevitable. The motivation behind the development of this article is to apply the concept of 2-odd labeling on graphs generated by using various graph operations, besides recalling a few interesting applications of graph labeling and graph coloring.
Cilt
14Sayı
2Bağlantı
http://belgelik.isikun.edu.tr/xmlui/handle/iubelgelik/5963https://jaem.isikun.edu.tr/web/index.php/current/124-vol14no2/1209
Koleksiyonlar
Aşağıdaki lisans dosyası bu öğe ile ilişkilidir: