On Vertex, Edge Matrix Cordial Labeling

Let G be a simple undirected graph whose vertices are from non cyclic abelian group and there is an edge between any two vertices iff vertices form a non singular matrix. Here we assign the Matrix Cordial Labeling to the vertices. In this paper we introduce the concept of Matrix Cordial labeling for some splitting graphs We shall discuss Matrix Cordial Labeling for path, cycle . Conclusions: In this paper we investigated three new matrix cordial graphs. The findings in this paper are original. For a better understanding of the labeling pattern specified in each theorem, illustrations are given at the conclusion of each theorem.