k-Total mean cordial graphs

R. Ponraj, S. Subbulakshmi, S. Somasundaram

Abstract


Let G be a (p,q) graph. Let f: V (G) → {0,1,2,3,..., k −1} be a function where k ∈ N and k > 1. For each edge uv, assign the label f(uv) = ⌈f(u)+f(v)/2⌉. f is called k-total mean cordial labeling of G if |tm f(i)−tm f(j)| ≤ 1, i, j ∈ {0,1,2,..., k −1}, where tm f(x) denotes the total number of vertices and edges labelled with x, x ∈ {0,1,2,..., k −1}. A graph with admit a k-total mean cordial labeling is called k-total mean cordial graph.

Full Text: PDF

Published: 2020-07-06

How to Cite this Article:

R. Ponraj, S. Subbulakshmi, S. Somasundaram, k-Total mean cordial graphs, J. Math. Comput. Sci., 10 (2020), 1697-1711

Copyright © 2020 R. Ponraj, S. Subbulakshmi, S. Somasundaram. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

J. Math. Comput. Sci.

ISSN: 1927-5307

Editorial Office: jmcs@scik.org

 

Copyright ©2020 JMCS