Vector Basis S-Cordial Labeling of Graphs
Abstract
Let G be a (p, q) graph. Let V be an inner product space with basis S. We denote the inner product of the vectors x and y by <x, y>. Let φ: V(G)→S be a function. For edge uv assign the label <ϕ(u), ϕ(v)>. Then ϕ is called a vector basis S-cordial labeling of G if |φx−φy|≤1 and |γi-γj|≤1 where φx denotes the number of vertices labeled with the vector x and γi denotes the number of edges labeled with the scalar i. A graph which admits a vector basis S-cordial labeling is called a vector basis S-cordial graph. In this paper, we investigate the vector basis S-cordial labeling behavior of certain standard graphs like path, cycle, complete graph and star graph.
Copyright © 2025 R. Ponraj, R. Jeya. 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.
Cite this article
R. Ponraj, R. Jeya, Vector Basis S-Cordial Labeling of Graphs, J. Math. Comput. Sci. 15 (2025), 5. https://doi.org/10.28919/jmcs/9116
BibTeX
@article{Ponraj2025,
author = {Ponraj, R. and Jeya, R.},
title = {Vector Basis S-Cordial Labeling of Graphs},
journal = {J. Math. Comput. Sci.},
volume = {15},
year = {2025},
pages = {5},
doi = {10.28919/jmcs/9116}
}