Scholarlink

A graph is considered a vertex odd mean graph(VOM) [5] if there is an 1-1 function \(\phi : V(G)\to \{1,3,5,..., 2q-1\}\) . This function induces a distinct labeling \(\phi ^* : E(G)\) with positive integer defined by \(\phi ^*(u\upsilon ) = \frac {\phi (u) + \phi (\upsilon )}{2}\) for each edge \(u\upsilon \) . This paper explores the super subdivision of vertex odd mean labeling in star and ladder graph.

错误：搜索内容不能为空，请输入英文关键词
错误：关键词超出字数限制，请精简
高级检索

Vertex Odd Mean(VOM) Labeling of Super Subdivision of Some Graphs

  • 会议论文

  • 发表日期：

    2025年

查看全文
  • D. Devakirubanithi,
  • J. Jeba Jesintha,
  • E. Mercy Gunaseeli

摘要

A graph is considered a vertex odd mean graph(VOM) [5] if there is an 1-1 function \(\phi : V(G)\to \{1,3,5,..., 2q-1\}\) . This function induces a distinct labeling \(\phi ^* : E(G)\) with positive integer defined by \(\phi ^*(u\upsilon ) = \frac {\phi (u) + \phi (\upsilon )}{2}\) for each edge \(u\upsilon \) . This paper explores the super subdivision of vertex odd mean labeling in star and ladder graph.