2016/04/08 by M. I. Moussa, Moussa, M. I., E. M. Badr +1
Computer Science · Social Sciences · #Advanced Computing and Algorithms #B.2.4 #B.4.0 #C.2.0 #FOS: Computer and information sciences #Graph Labeling and Dimension Problems #Information Theory (cs.IT)
paper · pdf · doi:10.48550/arxiv.1604.02347
openalex publication_date 2016/04/08 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
The ladder graph plays an important role in many applications as Electronics, Electrical and Wireless communication areas. The aim of this work is to present a new class of odd graceful labeling for the ladder graph. In particular, we show that the ladder graph Ln with m-pendant Ln + mk1 is odd graceful. We also show that the subdivision of ladder graph Ln with m-pendant S(Ln) + mk1 is odd graceful. Finally, we prove that all the subdivision of triangular snakes (delt-k snake) with pendant edges S(delt-k snake)+ mk are odd graceful.