Abstract
In the past few years many scientists have tried to develop models of networks and to investigate the mechanisms that determine the topology of complex networks. We define a class of graphs called (k,m)-dragon graphs and uniformly (k,m)-dragon graphs as referenced models of complex networks. These dragon graphs have some properties such as its admits (k,d)-odd-graceful labeling, graceful labellings, odd-graceful labellings and so on. In this paper, we proposed and defined the notion of some labelings of dragon graphs, the odd-graceful, graceful and total labellings of edges magic of these dragon graphs have been investigated in detail, and our methods can be algorithmic. Through the definition of dragon graphs and proofs of Theorems, we get some simple but usefulconclusions.
Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
