International Journal of Mathematics Trends and Technology
Volume 33 | Number 2 | Year 2016 | Article Id. IJMTT-V33P520 | DOI : https://doi.org/10.14445/22315373/IJMTT-V33P520
A (p.q) graph G(V,E) is said to be a difference speed sequence graceful graph if there exists a bijection f: V(G) → { 0, 1, 2, …q2 } such that the induced mapping f: E(G) →{Δi(x)}/ i=1, 2, 3, …n}defined by f(uv) = |f(u) – f(v) |is a bijection. Here Δ m(x) = (Δ mxk) = |(xk – xk+m)| and (x) is the Fibonacci sequence . The function f is called a difference speed sequence graceful graph. In this paper we prove that the star K1 , n ,the path graph, the comb graph, bistar Bm, n, crown graph C3 ʘ k1, 2, and various types of graph are difference speed sequence graph.
[1] J. A.Bondy and U.S.R. Murty, 1976, Graph Theory with applications, London: Macmillan.
[2] J.A. Gallian, A dynamic survey of graph labeling, Electronic journal of combinatorics, 17(2014), # DS6(2014).
[3] R.B.Gnanajothi, Topics in Graph Theory
[4] S.W.Golomb , How to number a graph in graph theory and computing
[5] F. Harary, Graph theory (Addison-Wesley, Reading, MA 1969).
[6] K. Indirani, On “Rate sequence spaces”, thesis submitted to Mother Teresa Women‟s University.
[7] A. Rosa, “ On certain values of the vertices of the graph”, Theory of graphs ( Intl. Symp., Rome, 1966) Gordon and Breach, Dunod, Paris, 1967.
[8] Solairaju. A. Chithra, K. Edge odd graceful labeling of some graphs, Proceedings of the ICMCS 2008; 1: 101 – 107.
S. Uma Maheswari, Dr. K. Indirani, "Difference Speed sequence graph," International Journal of Mathematics Trends and Technology (IJMTT), vol. 33, no. 2, pp. 142-147, 2016. Crossref, https://doi.org/10.14445/22315373/IJMTT-V33P520
PDF 
Abstract 
Keywords 
References 
Citation