文章基本信息

标题：On Study of Vertex Labeling of Graph Operations
其他标题：On Study of Vertex Labeling of Graph Operations
本地全文：下载
作者：M. A. Rajan ; N. M. Kembhavimath ; V. Lokesha 等
期刊名称：Journal of Scientific Research
印刷版ISSN：2070-0237
电子版ISSN：2070-0245
出版年度：2011
卷号：3
期号：2
页码：291-301
DOI：10.3329/jsr.v3i2.6222
语种：English
出版社：Rajshahi University
摘要：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)
关键词：Mathematics;Subdivision; Graph labeling; Direct sum; Direct product.