首页    期刊浏览 2024年12月02日 星期一
登录注册

文章基本信息

  • 标题:Vertex Equitable Labeling of Cycle and Star Related Graphs
  • 本地全文:下载
  • 作者:P. Jeyanthi ; A. Maheswari ; M, Vijaya-Laksmi
  • 期刊名称:Journal of Scientific Research
  • 印刷版ISSN:2070-0237
  • 电子版ISSN:2070-0245
  • 出版年度:2015
  • 卷号:7
  • 期号:3
  • 页码:33-42
  • DOI:10.3329/jsr.v7i3.22810
  • 语种:English
  • 出版社:Rajshahi University
  • 摘要:Let G be a graph with p vertices and q edges and A = {0,1,2,…..,[q/2]} A vertex labeling f: V (G) ? A induces an edge labeling f* defined by f*(uv) = f(u) + f(v) for all edges uv. For ? ? A, let vf (a) be the number of vertices v with f(v) = a. A graph G is said to be vertex equitable if there exists a vertex labeling f such that for all a and b in A, |?f (?) - ?f (b)|? 1 and the induced edge labels are 1, 2, 3,…, q. In this paper, we prove that jewel graph Jn, jelly fish graph (JF)n, balanced lobster graph BL(n,2,m), Ln ? Km (mean value) and are vertex equitable graphs.
  • 其他摘要:Let G be a graph with p vertices and q edges and A = {0,1,2,…..,[q/2]} A vertex labeling f : V ( G ) ? A induces an edge labeling f * defined by f * ( uv ) = f ( u ) + f ( v ) for all edges uv . For ? ? A , let v f ( a ) be the number of vertices v with f(v) = a . A graph G is said to be vertex equitable if there exists a vertex labeling f such that for all a and b in A , | ? f (? ) - ? f (b ) | ? 1 and the induced edge labels are 1, 2, 3,…, q . In this paper, we prove that jewel graph J n , jelly fish graph ( JF) n , balanced lobster graph BL ( n, 2 ,m ), L n ? K m (mean value) and < L n ôK 1,m > are vertex equitable graphs.
  • 关键词:Vertex equitable labeling;Vertex equitable graph;Jewel graph;Jelly fish;Balanced lob star.
国家哲学社会科学文献中心版权所有