본문 바로가기
KERD
논문KCI 등재

PARTITIONS AND LABELED TREES

2

조회

0

다운로드

0

인용

0

참고문헌

키워드

주제분류수학

초록

In this paper, we present a new representation of partitions of positive integers using labeled trees. Labeled trees representing a partition of an integer n is called a partition-tree of n. We discuss some results involving partition-trees, energy of an integer with respect to partition-trees, and gracefulness of the default labeling of partition trees.

Abstract

In this paper, we present a new representation of partitions of positive integers using labeled trees. Labeled trees representing a partition of an integer n is called a partition-tree of n. We discuss some results involving partition-trees, energy of an integer with respect to partition-trees, and gracefulness of the default labeling of partition trees.

참고문헌 (9)

  1. G. Andrews, "The Theory of Partitions (Encyclopedia of Mathematics and its Applica-tions)" (1984), Cambridge University Press
  2. N. Deo, "Graph Theory with Computer Applications to Engineering and Computer Sci-ence" (2002), Prentice-Hall of India
  3. J. W. Moon, "Counting labeled trees", Canadian Mathematical Monographs, (1) (1970)
  4. I. Gutman, "The energy of a graph", Ber. Math.-Statist. Sekt. Forschungsz. Graz, 103, pp.1~22 (1978)
  5. I. Gutman, "The energy of a graph: old and new results, Algebraic Combinatorics &Applications", pp.196~211 (2001), Springer
  6. J. H. Koolen, "Maximal energy graphs", Adv. Appl. Math., 26, pp.47~52 (2001)
  7. J. H. Koolen, "Maximal energy bipartite graphs", Graphs Combin, 19, pp.131~135 (2003)
  8. B. J. McClelland, "Properties of the latent roots of a matrix: The estimation of π-electron energies", J. chem. Phys., 54, pp.640~643 (1971)
  9. R. Rajendra, "Ring and Module Structures on Zn-Labeled Trees", International Journal of Engineering, Applied and Management Sciences Paradigms, 54(1), pp.192~193 (2019)

관련 논문AI추천

이 간행물의 다른 논문 (9건)