LADDER AND SUBDIVISION OF LADDER GRAPHS WITH PENDANT EDGES ARE ODD GRACEFUL

Autor:	M. I. Moussa, E.M. Badr
Jazyk:	angličtina
Rok vydání:	2021
Předmět:	FOS: Computer and information sciences Information Theory (cs.IT) Computer Science - Information Theory Graph Labelling Odd Graceful Graphs Ladder Graph Cyclic Snakes Pendant Edges B.4.0 B.2.4 C.2.0
DOI:	10.5281/zenodo.4529031
Popis:	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. 8 pages, 2 figures
Databáze:	OpenAIRE
Externí odkaz:	https://explore.openaire.eu/search/publication?articleId=doi_dedup___::afb0db8026412780d13d7c5f390cc4c3 Zobrazit plný text záznamu