Sanprasert, Wannaporn
Loading...
2 results
Now showing 1 - 2 of 2
- Some of the metrics are blocked by yourconsent settings
Item type:Publication, Super Edge-Magic Labeling of Some Fan Graphs(2017-01-01); For a graph G(V, E) with p vertices and q edges, a bijective function f from V (G)?E(G) to {1, 2, ..., p+q} is called a super edge-magic labeling of G if f(V (G)) = {1, 2, ..., p} and there exists a constant k such that for any edge uv of G, f(u) + f(v) + f(uv) = k. A graph G is called super edge-magic if there exists a suber edge-magic labeling of G. In this paper, we shows that the fan graph Fn,2 and mFn,2 is a super edge-magic where n is a positive integer, m positive odd number and m ? 3. - Some of the metrics are blocked by yourconsent settings
Item type:Publication, A formula for the number of labelled trees in complete bipartite graph(2020-11-24); In this paper, we use Prilfer's construction and exponential generating function to find the formula of the number of labelled tree with r<inf>1</inf>, r<inf>2</inf> end-vertices in complete bipartite graph K<inf>m,n</inf> denoted by L(m, n, r<inf>1</inf>, r<inf>2</inf>). For (equ).