Zobrazeno 1 - 8
of 8
pro vyhledávání: '"Super graceful labeling"'
Let $G=(V(G),E(G))$ be a simple, finite and undirected graph of order $p$ and size $q$. For $k\ge 1$, a bijection $f: V(G)\cup E(G) \to \{k, k+1, k+2, \ldots, k+p+q-1\}$ such that $f(uv)= |f(u) - f(v)|$ for every edge $uv\in E(G)$ is said to be a $k$
Externí odkaz:
http://arxiv.org/abs/1807.01203
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Publikováno v:
AKCE International Journal of Graphs and Combinatorics, Vol 13, Iss 2, Pp 200-209 (2016)
Let G=(V(G),E(G)) be a simple, finite and undirected graph of order p and size q. A bijection f:V(G)∪E(G)→{k,k+1,k+2,…,k+p+q−1} such that f(uv)=|f(u)−f(v)| for every edge uv∈E(G) is said to be a k-super graceful labeling of G. We say G is
Externí odkaz:
https://doaj.org/article/0ed839840a3343098c50bb9bc5b5301f
Publikováno v:
In AKCE International Journal of Graphs and Combinatorics August 2016 13(2):200-209
Publikováno v:
International Journal of Mathematics and Soft Computing. 2:35
Let G be a ( p, q ) - graph. A bijective function f : V ( G ) âˆa E ( G ) → { 1 , 2 , ..., p + q } such that f ( uv ) = | f ( u ) − f ( v ) | for every edge uv E ( G ) is said to be a super graceful labeling. A graph G is called a supe
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::bcef7d18812daed84adae1adbfaf1df3
https://doi.org/10.26708/ijmsc.2012.1.2.05
https://doi.org/10.26708/ijmsc.2012.1.2.05
Publikováno v:
AKCE International Journal of Graphs and Combinatorics, Vol 13, Iss 2, Pp 200-209 (2016)
Let G = ( V ( G ) , E ( G ) ) be a simple, finite and undirected graph of order p and size q . A bijection f : V ( G ) ∪ E ( G ) → { k , k + 1 , k + 2 , … , k + p + q − 1 } such that f ( u v ) = | f ( u ) − f ( v ) | for every edge u v ∈
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::97d61a99017abd7f67910ed0e3d224c2
Let $G=(V(G),E(G))$ be a simple, finite and undirected graph of order $p$ and size $q$. For $k\ge 1$, a bijection $f: V(G)\cup E(G) \to \{k, k+1, k+2, \ldots, k+p+q-1\}$ such that $f(uv)= |f(u) - f(v)|$ for every edge $uv\in E(G)$ is said to be a $k$
Externí odkaz:
http://arxiv.org/abs/1807.01188
Autor:
Wu, Shufei1 (AUTHOR) 212010010004@home.hpu.edu.cn, Wang, Mengyuan1 (AUTHOR)
Publikováno v:
Symmetry (20738994). Apr2022, Vol. 14 Issue 4, pN.PAG-N.PAG. 10p.