F-centroidal mean labeling of graphs obtained from paths
Int. J. Math. Comb, 2019•books.google.com
A function f is called an F-centroidal mean labeling of a graph G (V, E) with p vertices and q
edges if f: V (G)→{1, 2, 3,···, q+ 1} is injective and the induced function f*: E (G)→{1, 2, 3,···, q}
defined as 2 [f (u) 2+ f (u) f (v)+ f (v) 2] 3 [f (u)+ f (v)] for all uv∈ E (G), is bijective. A graph that
admits an F-centroidal mean labeling is called f*(uv)=
edges if f: V (G)→{1, 2, 3,···, q+ 1} is injective and the induced function f*: E (G)→{1, 2, 3,···, q}
defined as 2 [f (u) 2+ f (u) f (v)+ f (v) 2] 3 [f (u)+ f (v)] for all uv∈ E (G), is bijective. A graph that
admits an F-centroidal mean labeling is called f*(uv)=
Abstract
A function f is called an F-centroidal mean labeling of a graph G (V, E) with p vertices and q edges if f: V (G)→{1, 2, 3,···, q+ 1} is injective and the induced function f*: E (G)→{1, 2, 3,···, q} defined as
2 [f (u) 2+ f (u) f (v)+ f (v) 2] 3 [f (u)+ f (v)] for all uv∈ E (G), is bijective. A graph that admits an F-centroidal mean labeling is called f*(uv)=
books.google.com
以上显示的是最相近的搜索结果。 查看全部搜索结果