Local total anti-magic chromatic number of graphs

图的局部总反魔色数

阅读:1

Abstract

Let G = (V, E) be a graph without isolated vertices and let |V(G)| = n and |E(G)| = m. A bijection π:V(G) ∪ E(G) → {1, 2, ...., n + m} is said to be local total anti-magic labeling of a graph G if it satisfies the conditions: (i.) for any edge uv, ω(u) ≠ ω(v), where u and v in V(G) (ii.) for any two adjacent edges e and e', ω(e) ≠ ω(e') (iii.) for any edge uv ∈ E(G) is incident to the vertex v, ω(v) ≠ ω(uv), where weight of vertex u is, ω(u) = ∑e∈S(u)π(e), S(u) is the set of edges with every edge of S(u) one end vertex is u and an edge weight is ω(e = uv) = π(u) + π(v). In this paper, we have introduced a local total anti-magic labeling (LTAL) and the local total anti-magic chromatic number (LTACN). Also, we obtain the LTACN for the graphs Pn, K1,n, Fn and Sn,n.

特别声明

1、本页面内容包含部分的内容是基于公开信息的合理引用;引用内容仅为补充信息,不代表本站立场。

2、若认为本页面引用内容涉及侵权,请及时与本站联系,我们将第一时间处理。

3、其他媒体/个人如需使用本页面原创内容,需注明“来源:[生知库]”并获得授权;使用引用内容的,需自行联系原作者获得许可。

4、投稿及合作请联系:info@biocloudy.com。