Research Article
Two Labelings Techniques for Corona Graph Cn*K1
|
International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
|
| Volume 64 - Issue 12 |
| Published: February 2013 |
| Authors: Veena Shinde-Deore, Manisha M. Acharya |
10.5120/10685-5582
|
Veena Shinde-Deore, Manisha M. Acharya . Two Labelings Techniques for Corona Graph Cn*K1. International Journal of Computer Applications. 64, 12 (February 2013), 10-13. DOI=10.5120/10685-5582
@article{ 10.5120/10685-5582,
author = { Veena Shinde-Deore,Manisha M. Acharya },
title = { Two Labelings Techniques for Corona Graph Cn*K1 },
journal = { International Journal of Computer Applications },
year = { 2013 },
volume = { 64 },
number = { 12 },
pages = { 10-13 },
doi = { 10.5120/10685-5582 },
publisher = { Foundation of Computer Science (FCS), NY, USA }
}
%0 Journal Article
%D 2013
%A Veena Shinde-Deore
%A Manisha M. Acharya
%T Two Labelings Techniques for Corona Graph Cn*K1%T
%J International Journal of Computer Applications
%V 64
%N 12
%P 10-13
%R 10.5120/10685-5582
%I Foundation of Computer Science (FCS), NY, USA
Abstract
Labeling of graphs is an assignment of integers to the vertices or edges or both using some conditions. There are various labelings techniques such as feliticious labeling, graceful labelings, harmonious labeling, magic labeling etc. applied to certain classes of graphs. H-cordiality is proved for wheels, generalized Peterson graph, triangular graph and special ladder. In this paper, H-cordial labeling and prime labelings of the corona graph Cn*K1 for n ? 3 is obtained.
References
- Lee,S. M. Wue,I. and Yeh,I. (1988). On the amalgamation of prime graphs, Bull Malayasian Math. Soc. ,(2)11,59-67.
- Christian Barrientos. (2002). Graceful labeling of Chains and Corona graphs. Bull. Inst. Combin. Appli,Vol-34,pp. 17-26.
- Timothy A. Redl . (2003). Graceful Graphs and Graceful labeling: Two mathematical programming formulations and some other new results. Computational and Applied mathematics; pp. 1-13.
- Christian Barrientos . (2005). Graceful graphs with pendant edges. Australian journal of Combinatorics, Vol- 33,pg:99-107.
- Christian Barrientos. (2002). Equitable labeling of Corona graphs. JCMCC,Vol- 41,pp. 139-149.
- Harary, F. (1972). Graph Theory. Addison-Wesley Publishing Company.
- Gallian, J. A. (2011). A dynamic survey of graph labeling. Electronic Journal of Combinatorics,DS6.
- Devraj, J. and Prem Delphy, P. (2011). On H-cordial graphs. International J. of Math. Sci. & Engg. Appls. (IJMSEA),Vol. 5,No. V,pp. 287-296.
- Grace, T. (1983). ,J. Graph Theory. vol-7. pp 195-203.
- Ramya, N. ; Rangarajan, K. ; Sattanathan, R. (2012). On prime labeling of some classes of graph. International Journal of Computer applications, 44(4), pp 1-3.
- Yung-Ling Lai and General J. Chang. (2003). On the profile of the corona of two graphs. National Science council under grant NSC92-2115-m002-015, , 1-10.
- Rosa, A. (1966). On certain valuations of the vertices of a graph. Theory of Graphs (International symposium, Rome, Gordon and Breach, N. Y. and Dunod Paris),pp. 349-355.
- Yilmaz,R. and Cahit,I. ,(1997). E-Cordial graphs. ARS Combinatoria. 251-256
- Ramya, N. ; Rangarajan, K. ; Sattanathan, R. (2011). 4-regular graphs and its prime labeling. IJCGTA.
Index Terms
Keywords