Journal of applied mathematics & informatics

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

DOI QR Code

ON 4-TOTAL MEAN CORDIAL GRAPHS

  • PONRAJ, R. (Department of Mathematics, Sri Paramakalyani College) ;
  • SUBBULAKSHMI, S. (Department of Mathematics, Manonmaniam sundarnar university) ;
  • SOMASUNDARAM, S. (Department of Mathematics, Manonmaniam sundarnar university)
  • Received : 2020.06.15
  • Accepted : 2021.04.20
  • Published : 2021.05.30
Download PDF
⟨ Previous Next ⟩

Abstract

Let G be a graph. Let f : V (G) → {0, 1, …, k - 1} be a function where k ∈ ℕ and k > 1. For each edge uv, assign the label $f(uv)={\lceil}{\frac{f(u)+f(v)}{2}}{\rceil}$. f is called k-total mean cordial labeling of G if ${\mid}t_{mf}(i)-t_{mf}(j){\mid}{\leq}1$, for all i, j ∈ {0, 1, …, k - 1}, where tmf (x) denotes the total number of vertices and edges labelled with x, x ∈ {0, 1, …, k-1}. A graph with admit a k-total mean cordial labeling is called k-total mean cordial graph.

Keywords

References

  1. J.A. Gallian, A Dynamic survey of graph labeling, The Electronic Journal of Combinatorics 2019, #Ds6.
  2. F. Harary, Graph theory, Addision wesley, New Delhi, 1969.
  3. R. Ponraj, S. Subbulakshmi, S. Somasundaram, k-total mean cordial graphs, J. Math. Comput. Sci. 10 (2020), 1697-1711.
  4. R. Ponraj, S. Subbulakshmi, S. Somasundaram, 4-total mean cordial graphs derived from paths, J. Appl and Pure Math. 2 (2020), 319-329.
  5. R. Ponraj, S. Subbulakshmi, S. Somasundaram, 4-total mean cordial labeling in subdivision graphs, Journal of Algorithms and Computation 52 (2020), 1-11.