Linear Incidence Edge Prime Labeling – More Results on Path Related Di Graphs
收藏DataCite Commons2025-05-12 更新2025-05-17 收录
下载链接：
https://dataverse.harvard.edu/citation?persistentId=doi:10.7910/DVN/QFHWKA
下载链接
链接失效反馈官方服务：
资源简介：
Abstract
Objectives: Our aim is to find new families of di graphs that admit linear incidence edge prime labeling.
Methods/statistical analysis: Here the vertices are assigned with 0,1,…,m−1 and edges with 2g(v) + g(u), where u is the initial vertex and v is the terminal vertex and g is the vertex labeling function. The graph is prime when the greatest common incidence number of vertices with in degree greater than one is one.
Findings: Here we prove that di graph of corona product of Pn with K2, strong shadow graph of path Pn, strong splitting graph of path Pn, square graph of path Pn, tortoise graph of path Pn, graph obtained by joining the corresponding internal vertices of two copies of path Pn, strong Z graph of path Pn admit linear incidence edge prime labeling.
Application/improvements: One can generalize these results and find some structural properties. These results may be applied to the transportation problem, chemical graph theory and decision analysis.
Keywords: Linear, Incidence, Prime Labeling, Strong Z Graph of Path Pn, Strong Shadow Graph of Path Pn, Strong Splitting Graph of Path Pn.
提供机构：
Harvard Dataverse
创建时间：
2025-04-17
