ResearchBib Share Your Research, Maximize Your Social Impacts
Sign for Notice Everyday Sign up >> Login

Cordial Labeling of Kn;n related graphs

Journal: International Journal of Science and Research (IJSR) (Vol.2, No. 5)

Publication Date:

Authors : ; ;

Page : 74-77

Keywords : complete bipartite graph Kn; n; Cordial graph; Path union;

Source : Downloadexternal Find it from : Google Scholarexternal


It is proved by cahit that Km, n is cordial for all m and n. In this paper cordial labeling for three graphs related to complete bipartite graph Kn, n is discussed. We prove that (1) star of Kn, n, (2) path union of Kn, n, and (3) the graph obtained by joining two copies of Kn, n by a path of arbitrary length are cordial graphs

Last modified: 2021-06-30 20:16:32