Staff Members - Benha University
M.I.Moussa and E. M. Badr (2016) Ladder and Subdivision of Ladder graphs with pendant edges are odd graceful, journal on application of graph theory in wirless Ad hoc networs and sensor networks (GRAPHS-HOC) Vol.8, No.1, March 2016
journal on applications of graph theory in wirless ad hoc networks and sensor networks (GRAPH-HOC) • 2016
Publication Information
Authors
M.I.Moussa and E. M. Badr
Keywords
Not Available
Journal
journal on applications of graph theory in wirless ad hoc networks and sensor networks (GRAPH-HOC)
Publisher
Not Available
Volume
Not Available
Issue
Not Available
Pages
Not Available
publication.type
International
Paper Link
Not Available
Supplementary Materials
Not Available
Abstract
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 ( k snake ) with pendant edges
S (k snake) mk1 are odd graceful.
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 ( k snake ) with pendant edges
S (k snake) mk1 are odd graceful.