Share Your Research, Maximize Your Social Impacts
Cordial Labeling of Kn;n related graphs
Journal: International Journal of Science and Research (IJSR) (Vol.2, No. 5)Publication Date: 2013-05-05
Authors : G. V. Ghodasara; A. H. Rokad;
Page : 74-77
Keywords : complete bipartite graph Kn; n; Cordial graph; Path union;
Source : Download
Find it from : Google Scholar
Abstract
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
Other Latest Articles
- Detection and Mitigation Techniques of Black Hole Attack in MANET: An Overview
- Query Explication by Semantic Approach
- Lipid patterns in Sub clinical hypothyroidism of non-obese group in Rural tertiary care centre
- Human Identification by Ear Images Using SIFT Algorithm
- Design and interfacing of the optical assembly For Automated Analyzer
Last modified: 2021-06-30 20:16:32