Journal of applied mathematics & informatics

한국전산응용수학회 (The Korean Society for Computational and Applied Mathematics)
권호 표지
DOI QR코드

DOI QR Code

SOME 4-TOTAL PRIME CORDIAL LABELING OF GRAPHS

  • PONRAJ, R. (Department of Mathematics, Sri Paramakalyani College) ;
  • MARUTHAMANI, J. (Department of Mathematics, Manonmaniam sundarnar university) ;
  • KALA, R. (Department of Mathematics, Manonmaniam sundarnar university)
  • 투고 : 2018.10.23
  • 심사 : 2018.12.07
  • 발행 : 2019.01.30
PDF 다운로드
⟨ 이전 논문 다음 논문 ⟩

초록

Let G be a (p, q) graph. Let $f:V(G){\rightarrow}\{1,2,{\ldots},k\}$ be a map where $k{\in}{\mathbb{N}}$ and k > 1. For each edge uv, assign the label gcd(f(u), f(v)). f is called k-Total prime cordial labeling of G if ${\mid}t_f(i)-t_f(j){\mid}{\leq}1$, $i,j{\in}\{1,2,{\ldots},k\}$ where $t_f$(x) denotes the total number of vertices and the edges labelled with x. A graph with a k-total prime cordial labeling is called k-total prime cordial graph. In this paper we investigate the 4-total prime cordial labeling of some graphs.

키워드

E1MCA9_2019_v37n1_2_149_f0001.png 이미지

FIGURE 1

E1MCA9_2019_v37n1_2_149_f0002.png 이미지

FIGURE 2

E1MCA9_2019_v37n1_2_149_f0003.png 이미지

FIGURE 3

TABLE 1:

E1MCA9_2019_v37n1_2_149_t0001.png 이미지

참고문헌

  1. I. Cahit, Cordial graphs:A weaker version of graceful and harmonious graphs, Ars Combinatoria 23(1987), 201-207.
  2. J.A. Gallian, A Dynamic survey of graph labeling, The Electronic Journal of Combinatorics 19 (2017) #Ds6.
  3. F. Harary, Graph theory, Addision wesley, New Delhi (1969).
  4. R. Ponraj, J. Maruthamani and R. Kala, k-Total prime cordial labeling of graphs, Journal of Algorithms and Computation 50(1), 143-149.
  5. R. Ponraj, J. Maruthamani and R. Kala, Some classes of 4-Total prime cordial labeling of graphs, Global Journal of Engineering science and Researches 5(11), 319-327.