Zobrazeno 1 - 9
of 9
pro vyhledávání: '"N. Angel Benseera"'
Autor:
P. Jeyanthi, N. Angel Benseera
Publikováno v:
Opuscula Mathematica, Vol 34, Iss 1, Pp 115-122 (2014)
A graph \(G\) is said to have a totally magic cordial (TMC) labeling with constant \(C\) if there exists a mapping \(f: V(G)\cup E(G)\rightarrow \left\{0,1\right\}\) such that \(f(a) + f(b) + f(ab) \equiv C(\mbox{mod 2})\) for all \(ab\in E(G)\) and
Externí odkaz:
https://doaj.org/article/7f83b9ad46d74e71a4e28e1e4a820f22
Publikováno v:
Proyecciones (Antofagasta) v.34 n.4 2015
SciELO Chile
CONICYT Chile
instacron:CONICYT
Proyecciones (Antofagasta), Volume: 34, Issue: 4, Pages: 351-359, Published: DEC 2015
SciELO Chile
CONICYT Chile
instacron:CONICYT
Proyecciones (Antofagasta), Volume: 34, Issue: 4, Pages: 351-359, Published: DEC 2015
A graph G is said to be hypo-k-totally magic cordial if G - {v} is k-totally magic cordial for each vertex v in V(G). In this paper, we establish that cycle, complete graph, complete bipartite graph and wheel graph admit hypo-k-totally magic cordial
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::03205c2619c297970f96b693b78a1a72
https://doi.org/10.4067/s0716-09172015000400004
https://doi.org/10.4067/s0716-09172015000400004
Publikováno v:
Proyecciones (Antofagasta), Volume: 35, Issue: 4, Pages: 371-380, Published: 30 DEC 2016
Proyecciones (Antofagasta) v.35 n.4 2016
SciELO Chile
CONICYT Chile
instacron:CONICYT
Proyecciones (Antofagasta) v.35 n.4 2016
SciELO Chile
CONICYT Chile
instacron:CONICYT
A graph G is said to have a totally magic cordial labeling with constant C if there exists a mapping f : V(G) U E(G) → {0,1} such that f (a) + f (b) + f (ab) ≡ C (mod 2) for all ab ∈ E(G) and |n f (0) - n f (1)| ≤ 1, where n f(i) (i = 0, 1) i
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::7221841175ed3c3be7fd091918d84a56
http://www.scielo.cl/scielo.php?script=sci_arttext&pid=S0716-09172016000400001&lng=en&tlng=en
http://www.scielo.cl/scielo.php?script=sci_arttext&pid=S0716-09172016000400001&lng=en&tlng=en
Publikováno v:
SUT Journal of Mathematics = SUT Journal of Mathematics. 49(1):1-12
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=jairo_______::4de26b209154278efeefe57d0ab58111
http://id.nii.ac.jp/1275/00000923/
http://id.nii.ac.jp/1275/00000923/
Autor:
Jeyanthi, P., Benseera, N. Angel, Mary, M. Immaculate, P., Jeyanthi, N. Angel, Benseera, M. Immaculate, Mary
Publikováno v:
SUT Journal of Mathematics = SUT Journal of Mathematics. 49(1):13-18
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=jairo_______::f22b8f6011b4a5e4ccc68a061b08d08b
http://id.nii.ac.jp/1275/00000924/
http://id.nii.ac.jp/1275/00000924/
Autor:
P. Jeyanthi, N. Angel Benseera
Publikováno v:
SUT Journal of Mathematics. 49
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::4013c546312cca048880e2ccc3dde48d
https://doi.org/10.55937/sut/1378309917
https://doi.org/10.55937/sut/1378309917
Publikováno v:
SUT Journal of Mathematics. 49
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::4fdddef4e9e4bd34c928e5ec1ad633f1
https://doi.org/10.55937/sut/1378308983
https://doi.org/10.55937/sut/1378308983
Publikováno v:
Discrete Mathematics, Algorithms and Applications. :1550024
Let G = (V(G), E(G)) be a simple, finite and undirected graph of order n. Given a bijection f: V(G) ∪ E(G) → Zk such that for each edge uv ∈ E(G), f(u) + f(v) + f(uv) is constant C( mod k). Let nf(i) be the number of vertices and edges labeled
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::54f008bf6742d0f43e8cfb910c59b144
https://doi.org/10.1142/s179383091550024x
https://doi.org/10.1142/s179383091550024x
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.