Refine your search
Collections
Co-Authors
A B C D E F G H I J K L M N O P Q R S T U V W X Y Z All
Hemalatha, P.
- Odd Factor Decomposition of E-Super Magic Graphs
Abstract Views :434 |
PDF Views:378
Authors
P. Hemalatha
1,
V. Nivetha
1
Affiliations
1 Department of Mathematics, Vellalar College for Women, Erode – 638 012, Tamilnadu, IN
1 Department of Mathematics, Vellalar College for Women, Erode – 638 012, Tamilnadu, IN
Source
ScieXplore: International Journal of Research in Science, Vol 3, No 2 (2016), Pagination: 47-52Abstract
An F-magic labeling in an F-decomposable graph G of order p and size q is a bijection f :V (G)∪ E(G)→{1,2....p + q} such that for every copy F in the decomposition, ΣVeV(F)f(v) + Σe∈E(F)f(e) is constant. The function f is said to be F-E super magic if f (E(G)) = {1,2,....q}. This article contains, a necessary and some sufficient conditions for some even regular and odd regular graphs G to have an (2k +1) - factor E-super magic decomposition, for k ≥1.Keywords
F-Decomposable Graph, F-E Super Magic Labeling, (2k + 1)-Factor E-Super Magic Decomposition of Graphs.References
- Andrews W S. Magic Squares and Cubes. Dover. 1960.
- Marr A M. and Wallis W D. Magic Graphs. Second Edition. Boston: Birkhauser-Basel; 2013. https://doi.org/10.1007/9780-8176-8391-7
- Gallian J A. A Dynamic Survey of Graph Labeling. The Electronic Journal of Combinatorics. 2009; 16: DS6
- MacDougall J A, Miller M, Slamin, Wallis W D. Vertex Magic Total Labeling of Graphs. Util.Math. 2002; 61: 3–21.
- Marimuthu G, Balakrishnan M. E-Super Vertex Magic Labeling Of Graphs. Discrete Appl. Math. 2012; 160: 1766– 74. https://doi.org/10.1016/j.dam.2012.03.016
- Petersen J. Die Theories Der Regularen Graphs. Acta Math.1891; 15: 193–220. https://doi.org/10.1007/BF02392606
- Sedlacek J. On Magic Graphs. Mathematica Slovaca. 1976; 26: 329–335.
- Subbiah S P, Pandimadevi J. H-E Super Magic Decomposition of Graphs. Electronic Journal of Graph Theory and Applications. 2014; 2: 115–128. https://doi.org/10.5614/ ejgta.2014.2.2.4
- Swaminathan V, Jeyanthi P. Super Vertex-Magic Labeling. Indian J. Pure and App. Math. 2003; 34(6): 935-939.
- Wang T M, Zhang G H. Note on E-Super Vertex Magic Graphs. Discrete Applied Mathematics. 2014; 178: 160–2. https://doi.org/10.1016/j.dam.2014.06.009
- Oblong Mean Prime Labeling and Oblong Difference Mean Prime Labeling of Complete Graphs and Complete Multipartite Graphs
Abstract Views :332 |
PDF Views:147
Authors
P. Hemalatha
1,
V. Sudha
1
Affiliations
1 Department of Mathematics, Vellalar College for Women, Erode – 638 012, Tamil Nadu, IN
1 Department of Mathematics, Vellalar College for Women, Erode – 638 012, Tamil Nadu, IN
Source
ScieXplore: International Journal of Research in Science, Vol 6, No 2 (2019), Pagination: 61-69Abstract
The oblong numbers are in the form n(n+1), where n = 1,2, . . . . i.e., the oblong numbers are 2, 6, 12, . . . . If the vertices of the given graph G are labeled with oblong numbers and the edges of the graph are labeled with mean of the labels at the end vertices then G is said to have Oblong Mean Prime Labeling (OMPL). Similarly, if the vertices of G are labeled with oblong numbers and the edges of the graphs are labeled with mean of the absolute difference of the labels at the end vertices then G is said to have Oblong Difference Mean Prime Labeling (ODMPL). In this paper, the Oblong Mean Prime Labeling and Oblong Difference Mean Prime Labeling of Complete Graphs (CGs) Kn, n≥3 and Complete Multipartite Graphs (CMGs), K n n n n i 1 2 t 1 , , , , where 1i t ≤ ≤ have been investigated and obtained the results for such graphs.Keywords
Complete Graphs (CGs) and Complete Multipartite Graphs (CMGs), Oblong Difference Mean Prime Labeling(ODMPL), Oblong Mean Prime Labeling (OMPL)References
- Bondy JA, Murty USR. Graph Theory with Applications. New York: Elseveir Science Publishing Co., Inc; 1976. https://doi.org/10.1007/978-1-349-03521-2
- Chih - Hung Yen. On r - Equitable Coloring of Complete Multipartite Graphs. Taiwanese Journal of Mathematics. 2013; 17(3):1–8. https://doi.org/10.11650/tjm.17.2013.2666
- Gallian JA. A dynamic survey of graph labeling. The Electronic Journal of Combinatorics. 2009; 16:DS6.
- Mathew Varkey TK, Sunoj BS. Oblong Mean Prime Labeling of some cycle graphs. Advances in Dynamical Systems and Applications. 2017; 12(2):181–6.
- Mathew Varkey TK, Sunoj BS. Oblong Difference Mean Prime Labeling of some cycle graphs. International Journal of Statistics and Systems. 2017; 12(2):285–92.
- Mathew Varkey TK, Sunoj BS. Oblong Mean Prime Labeling of some snake graphs. International Journal on Recent and Innovation Trends in Computing and Communication. 2017; 5(6):5–7.
- Mathew Varkey TK, Sunoj BS. Oblong Difference Mean Prime Labeling of some cycle graphs. Anveshana’s International Journal of Reseach in Engineering and Applied Sciences. 2018; 3(2):78–81.
- Neville Robbins, Beginning Numbereory, Narosa Publishing House Pvt. Ltd., Reprint 2006.