Scholarlink

Jagadesh and Baskar Babujee (Edge vertex prime labeling for some class of graphs. In: National Conference on Recent Trends in Mathematics and its Applications, pp. 24-25 (2017)) introduced the concept of edge vertex prime labeling (EVPL), which entails finding a bijective function \(g : V(G) \cup E(G) \to \{1,2,\ldots ,\mid V(G) \cup E(G)\mid \}\) with the property that given any edge \(uv \in E(G)\) , the numbers \(g(u),g(v)\) and \(g(uv)\) are each prime relative to one another in pairs. This paper presents EVPL techniques applied to various trees and graphs, including the olive tree, F-tree, Y-tree, and ( \(n,t\) )-Kite graph.

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

Edge Vertex Prime Labeling (EVPL) of Certain Trees and Graphs

  • 会议论文

  • 发表日期：

    2025年

查看全文
  • Sharon Philomena V,
  • M. Gomathi

摘要

Jagadesh and Baskar Babujee (Edge vertex prime labeling for some class of graphs. In: National Conference on Recent Trends in Mathematics and its Applications, pp. 24-25 (2017)) introduced the concept of edge vertex prime labeling (EVPL), which entails finding a bijective function \(g : V(G) \cup E(G) \to \{1,2,\ldots ,\mid V(G) \cup E(G)\mid \}\) with the property that given any edge \(uv \in E(G)\) , the numbers \(g(u),g(v)\) and \(g(uv)\) are each prime relative to one another in pairs. This paper presents EVPL techniques applied to various trees and graphs, including the olive tree, F-tree, Y-tree, and ( \(n,t\) )-Kite graph.