Research Article
On the Total Vertex Irregularity Strength of Cycle Related Graphs and H-Graphs
|
International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
|
| Volume 52 - Issue 19 |
| Published: August 2012 |
| Authors: Indra Rajasingh, Bharati Rajan, V. Annamma |
10.5120/8312-1947
|
Indra Rajasingh, Bharati Rajan, V. Annamma . On the Total Vertex Irregularity Strength of Cycle Related Graphs and H-Graphs. International Journal of Computer Applications. 52, 19 (August 2012), 32-37. DOI=10.5120/8312-1947
@article{ 10.5120/8312-1947,
author = { Indra Rajasingh,Bharati Rajan,V. Annamma },
title = { On the Total Vertex Irregularity Strength of Cycle Related Graphs and H-Graphs },
journal = { International Journal of Computer Applications },
year = { 2012 },
volume = { 52 },
number = { 19 },
pages = { 32-37 },
doi = { 10.5120/8312-1947 },
publisher = { Foundation of Computer Science (FCS), NY, USA }
}
%0 Journal Article
%D 2012
%A Indra Rajasingh
%A Bharati Rajan
%A V. Annamma
%T On the Total Vertex Irregularity Strength of Cycle Related Graphs and H-Graphs%T
%J International Journal of Computer Applications
%V 52
%N 19
%P 32-37
%R 10.5120/8312-1947
%I Foundation of Computer Science (FCS), NY, USA
Abstract
Let G(V, E) be a simple graph. For a labeling the weight of a vertex x is defined as = + where N(x) is the set of neighbours of x. f is called a vertex irregular total k-labeling if for every pair of distinct vertices x and y . The minimum k for which the graph G has a vertex irregular total k-labeling is called the total vertex irregularity strength of G and is denoted by tvs(G). In this paper we find the total vertex irregularity strength of cycle related graphs H(n), DHF(n), F(n,2) and obtain a bound for the total vertex irregularity strength of H graphs H(k).
References
- Joseph A. Gallian, 2010. A Dynamic Survey of Graph Labeling. The Electronic Journal of Combinatorics.
- S. Baca, J. Jenrol, M. Miller & J. Ryan, 2007. On Irregular Total Labelings. Discrete Mathematics, vol. 307, pp. 1378-1388.
- Chunling. Irregular Total Labelings of some Families of Graph. Indian Journal of Pure and Applied Mathematics, to appear.
- J. Przybylo, 2008. Irregularity Strength of Regular Graphs. Electronic Journal of Combinatorics 15.
- J. Przybylo, 2008/2009. Linear Bound on the Irregularity Strength and Total Vertex Irregularity Strength of Graphs. SIAM Journal of Discrete Mathematics, 23, 511-516.
- Ahmaad, S. Ahtsham, Imran and A. Q. Baig. Vertex Irregular Labelings of Cubic Graphs. reprint.
- Wang, J. -J. , Hung, C. -N. , Tan, J. J. M. , Hsu, L. -H. and Sung T–Y, 2000. Construction Schemes for Fault Tolerant HamiltonianGraphs. Networks, 35, 233.
- Indra Rajasingh, Bharathi Rajan and Joice Punitha, 2007. Kernel in Cycle Related Graphs, Proceedings of the International Conference on Mathematics and Computer Science 275-278.
- Indra Rajasingh, Bharathi Rajan and Helda Mercy, 2009. Exact Wirelength of H Graphs on Path, Proceedings of the International Conference on Mathematics and Computer Science 275-278.
Index Terms
Keywords