Product Binary L-Cordial Labeling of Various Degree Splitting Graphs

Product Binary L-Cordial Labeling of Various Degree Splitting Graphs

This study examines the probability of the degree splitting operation results from various graphs being product binary L-cordial Graphs. The graphs under investigation include the Path graph (Pn), Comb graph (Pn ⊙ k1), Double comb graph (Pn ⊙ 2k1), Cycle graph (Cn), Shell graph (Sn) and Ladder graph...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Communications in Mathematics and Applications 2024-01, Vol.15 (1), p.417-429
Hauptverfasser: Prajapati, U. M., Patel, P. A.
Format: Artikel
Sprache:eng
Schlagworte:
Graphs
Labeling
Splitting
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:This study examines the probability of the degree splitting operation results from various graphs being product binary L-cordial Graphs. The graphs under investigation include the Path graph (Pn), Comb graph (Pn ⊙ k1), Double comb graph (Pn ⊙ 2k1), Cycle graph (Cn), Shell graph (Sn) and Ladder graph (Ln). The application of product binary L-cordial labeling demonstrates that these analyzed graphs exhibit characteristics of product binary L-cordial graphs.
ISSN:0976-5905
0975-8607
DOI:10.26713/cma.v15i1.2541