PL EN


Preferences help
enabled [disable] Abstract
Number of results
2020 | 145 | 274-285
Article title

Two Modulo Three Sum Graphs

Content
Title variants
Languages of publication
EN
Abstracts
EN
Let G = (V, E) be a graph with p vertices and q edges is said to be a two modulo three sum graph if there is an injective function f from V(G) to { a∶0≤a≤3q-1 and either a≡0(mod 3) or a≡2(mod 3)} where q is the number of edges of G and such that finduces a bijectionf^* from E(G) to {a∶2≤a≤3q-1 and a≡2(mod 3)} given byf^* (uv)=f(u)+f(v)and the function f is called two modulo three sum labeling of G. In this paper, we introduce an analog of sum labeling known as two modulo three sum labeling and we define two modulo three sum labeling of some tree related graphs. Also we prove that split star, mirror path graph, complete bipartite graph and C_4 ʘ〖nK〗_1 are two modulo three sum graphs.
Year
Volume
145
Pages
274-285
Physical description
Contributors
  • P.G. & Research Department of Mathematics, The M. D. T. Hindu College, Tirunelveli - 627010, Tamil Nadu, India
  • P.G. & Research Department of Mathematics, The M. D. T. Hindu College, Tirunelveli - 627010, Tamil Nadu, India
References
  • [1] B. Amutha and M.P. Syed Ali Nisaya, Hexagonal Sum Labeling of H-graphs. Adalya Journal, 8(10), 2019, 33-39
  • [2] M. Apostal, Introduction to Analytic Number Theory, Narosa Publishing House, Second Edition, 1991
  • [3] S. Arockiaraj and P. Mahalakshmi, On Odd Sum Graphs, International Journal of Mathematical Combinatorics, 4 (2013) 58-77
  • [4] J. A. Bondy and U. S. R. Murty. Graph Theory with Applications, Macmillan Press, London (1976).
  • [5] M. Ellingham, Sum Graphs from Trees. Ars Combinatoria, 35 (1993) 335-349
  • [6] J.A. Gallian, A Dynamic Survey of Graph Labeling. The Electronic Journal of Combinatorics, 22 (2019) #DS6
  • [7] B. Gayathri and V. Prakash, Necessary conditions for one modulo three mean labeling of graphs. International Journal of Engineering Sciences, Advanced Computing and Bio-Technology, 6(2) (2015) 41-61
  • [8] B. Gayathri and V. Prakash, One modulo three mean labeling of some special graphs. Mathematical Sciences International Research Journal, 4(2), 2015, 434-460
  • [9] S.W. Golomb, How to number a Graph, Graph Theory and Computing, R.C. Read, Academic Press, New York (1972)
  • [10] F. Harary, Graph Theory, Adision – Wesley, Reading Mass, 1969
  • [11] F. Harary, Sum Graphs and Difference Graphs. Congr. Numer. 72 (1990) 101-108
  • [12] F. Harary, I. R. Hentzel and D. Jacobs Digitizing Sum Graphs over the Reals, Caribbean J. Math. Comput. Sci. 1 (1991) 1-4
  • [13] F. Harary, Sum Graphs over all integers. Discrete Mathematics 124 (1994) 99-105
  • [14] P. Jeyanthi and A. Maheswari, One modulo three mean labeling of graphs. American Journal of Applied Mathematics and Statistics, 2(5) (2014) 302-306.
  • [15] P. Jeyanthi, A. Maheswari and P. Pandiraj, One Modulo Three Mean Labeling of Cycle Related graphs. International Journal of Pure and Applied Mathematics, Vol. 103, No. 4, 2015, 625-633
  • [16] P. Jeyanthi, A. Maheswari and P. Pandiraj, On one modulo three mean labeling of graphs. Journal of Discrete Mathematical sciences and Cryptography, 19(2) (2016) 375 –384
  • [17] D. Muthuramakrishanan and K. Bhagyasri, One modulo N mean Labeling of Graphs. International Journal of Scientific Research and Review, 7(8), 2018, 345-354
  • [18] I. Niven and Herbert S. Zuckerman, An Introduction to the Theory of Numbers, Wiley Eastern Limited, Third Edition, 1991
  • [19] K. R. Parthasarathy. Basic Graph Theory, Tata Mcgraw Hill Publishing Company Limited (1994).
  • [20] A. Rosa, On certain valuation of the vertices of a graph, Thoery of Graphs (Proc. Internat. Symposium, Rome, 1966), Gordon and Breach, N. Y and Dunod Paris (1967), 349-355
Document Type
article
Publication order reference
Identifiers
YADDA identifier
bwmeta1.element.psjd-cee27ef8-9762-40de-8f84-2e821597597e
JavaScript is turned off in your web browser. Turn it on to take full advantage of this site, then refresh the page.