On Vector Basis S-Cordial Graph

Let be a graph. Let be an inner product space with basis . We denote the inner product of the vectors x and y by Let be a function. For each edge assign the label. We say that is a vector basis -cordial labeling if and where denotes the number of vertices labeled with the vector and denotes the number of edges labeled with the scalar . A graph with a vector basis -cordial labeling is called a vector basis -cordial graph. In this paper, we investigate the vector basis-cordial labeling behavior of corona product of alternate generalized snake graph with m copies of K1 graph where is a basis in .Let be a graph. Let be an inner product space with basis . We denote the inner product of the vectors x and y by Let be a function. For each edge assign the label. We say that is a vector basis -cordial labeling if and where denotes the number of vertices labeled with the vector and denotes the number of edges labeled with the scalar . A graph with a vector basis -cordial labeling is called a vector basis -cordial graph. In this paper, we investigate the vector basis-cordial labeling behavior of corona product of alternate generalized snake graph with m copies of K1 graph where is a basis in ????4 .