On Study of Vertex Labeling of Graph Operations
DOI:
https://doi.org/10.3329/jsr.v3i2.6222Keywords:
Subdivision, Graph labeling, Direct sum, Direct product.Abstract
Vertices of the graphs are labeled from the set of natural numbers from 1 to the order of the given graph. Vertex adjacency label set (AVLS) is the set of ordered pair of vertices and its corresponding label of the graph. A notion of vertex adjacency label number (VALN) is introduced in this paper. For each VLS, VLN of graph is the sum of labels of all the adjacent pairs of the vertices of the graph. is the maximum number among all the VALNs of the different labeling of the graph and the corresponding VALS is defined as maximal vertex adjacency label set . In this paper for different graph operations are discussed.
Keywords: Subdivision; Graph labeling; Direct sum; Direct product.
© 2011 JSR Publications. ISSN: 2070-0237 (Print); 2070-0245 (Online). All rights reserved.
doi:10.3329/jsr.v3i26222 J. Sci. Res. 3 (2), 291-301 (2011)
Downloads
246
189
Downloads
Published
How to Cite
Issue
Section
License
© Journal of Scientific Research
Articles published in the "Journal of Scientific Research" are Open Access articles under a Creative Commons Attribution-ShareAlike 4.0 International license (CC BY-SA 4.0). This license permits use, distribution and reproduction in any medium, provided the original work is properly cited and initial publication in this journal. In addition to that, users must provide a link to the license, indicate if changes are made and distribute using the same license as original if the original content has been remixed, transformed or built upon.