On pentagonal sum labelings of graphs
2
조회
0
다운로드
0
인용
0
참고문헌
키워드
초록
Let G = (V,E) be an (n,m)-graph. A graph G is said to admit a pentagonal sum labeling, if its vertices can be labeled with distinct non-negative integers so that the values on the edges, obtained as the sum of the labels of their end vertices, are the first m pentagonal numbers. In this paper we show that certain classes of graphs admit pentagonal sum labeling and also that certain classes of graphs do not admit pentagonal sum labeling.
Abstract
Let G = (V,E) be an (n,m)-graph. A graph G is said to admit a pentagonal sum labeling, if its vertices can be labeled with distinct non-negative integers so that the values on the edges, obtained as the sum of the labels of their end vertices, are the first m pentagonal numbers. In this paper we show that certain classes of graphs admit pentagonal sum labeling and also that certain classes of graphs do not admit pentagonal sum labeling.
참고문헌 (9)
- G. S. Bloom, "Applications of numbered undirected graphs", Proc. IEEE, 65, pp.562~570 (1977)
- G. S. Bloom, "Numbered complete graphs, unusual rulers and assorted applications", Theory and Applications of Graphs, Lecture Notes in Math, 642, pp.53~65 (1978), Springer-Verlag
- J. A. Gallian, "A Dynamic Survey of Graph labelling", The Electronic Journal of Combinatorics, 18, pp.6~ (2011)
- F. Harary, "Graph Theory, 10th Reprint" (2001), Narosa Publishing House
- S. M. Hegde, "On triangular sum labelings of graphs, In Labelings of Discrete Structures and Applications", pp.109~115 (2008), Narosa Publishing House
- D. D. Somashekara, "On square sum labelings og graphs", Proc. Jangjeon Math. Soc., 15(1), pp.69~78 (2012)
- M. Sutton, "Sumable graphs labelings and their applications", 박사, pp.2001
- S. K. Vaidya, "Some important results on triangular sum graphs", Applied Math. Sci, 3(36), pp.1763~1772 (2009)
- D. B. West, "Introduction to Graph Theory" (2009), PHI Learning Private Ltd