Abstract A graph is called cordial if it has a 0 - 1 labeling such that the number of vertices (edges) labeled with ones and zeros dier by at most one. The conjunction of two graphs (V1;E1) and (V2;E2) is the graph G = (V;E), where V = V1 x V2 and u = (a1; a2), v = (b1; b2) are two vertices, then uv belongs to E if aibi belongs to Ei for i = 1 or 2. In this paper, we present necessary and sucient condition for cordial labeling for the conjunction of two paths, denoted by Pn ^ Pm. Also, we drive an algorithm to generate cordial labeling for the conjunction Pn ^ Pm.
Comments: 16 pages
[v1] 2018-09-17 17:16:10
Unique-IP document downloads: 17 times
Vixra.org is a pre-print repository rather than a journal. Articles hosted may not yet have been verified by peer-review and should be treated as preliminary. In particular, anything that appears to include financial or legal advice or proposed medical treatments should be treated with due caution. Vixra.org will not be responsible for any consequences of actions that result from any form of use of any documents on this website.
Add your own feedback and questions here:
You are equally welcome to be positive or negative about any paper but please be polite. If you are being critical you must mention at least one specific error, otherwise your comment will be deleted as unhelpful.