• Journal of applied mathematics & informatics
• /
• v.32 no.3_4
• /
• pp.377-387
• /
• 2014

Let G be a (p, q) graph. Let f be a map from V (G) to {1, 2, ${\ldots}$, p}. For each edge uv, assign the label ${\mid}f(u)-f(\nu){\mid}$. f is called a difference cordial labeling if f is a one to one map and ${\mid}e_f(0)-e_f(1){\mid}{\leq}1$ where $e_f(1)$ and $e_f(0)$ denote the number of edges labeled with 1 and not labeled with 1 respectively. A graph with admits a difference cordial labeling is called a difference cordial graph. In this paper, we investigate the difference cordial labeling behavior of triangular snake, Quadrilateral snake, double triangular snake, double quadrilateral snake and alternate snakes.

• Journal of applied mathematics & informatics
• /
• v.42 no.2
• /
• pp.353-366
• /
• 2024

A total coloring of a graph G is an assignment of colors to both the vertices and edges of G, such that no two adjacent or incident vertices and edges of G are assigned the same colors. In this paper, we have discussed the total coloring of M(T_n), M(D_n), M(DT_n), M(AT_n), M(DA(T_n)), M(Q_n), M(AQ_n) and also obtained the total chromatic number of M(T_n), M(D_n), M(DT_n), M(AT_n), M(DA(T_n)), M(Q_n), M(AQ_n).