Zobrazeno 1 - 10
of 13
pro vyhledávání: '"D. S. T. Ramesh"'
Publikováno v:
International Journal of Advances in Applied Mathematics and Mechanics, Vol 3, Iss 3, Pp 92-99 (2016)
Externí odkaz:
https://doaj.org/article/6aa277d79d1c4dc695ac5ce439f24ce1
Publikováno v:
Advances in Mathematics: Scientific Journal. 9:2389-2396
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::b9687a06f9a5457bf61328450513562e
https://doi.org/10.37418/amsj.9.5.2
https://doi.org/10.37418/amsj.9.5.2
Publikováno v:
International Journal of Engineering and Advanced Technology. 9:3743-3745
The four star graphs G = K1,l where l3 will be relaxed skolem mean if = 1 is the main purpose of this article.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::db2d84eb1c89c04d62fb61b704daac16
https://doi.org/10.35940/ijeat.c6354.029320
https://doi.org/10.35940/ijeat.c6354.029320
Let G = (V, E) be a simple graph. A set S V(G) is a dual dominating set of G (or bi-dominating set of G) if S is a dominating set of G and every vertex in S dominates exactly two vertices in V-S. The dual-domination number γdu(G) (or bi-dominatio
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::ea3ddcf02c12725cfdba0f07ac7fd9d7
https://zenodo.org/record/5577054
https://zenodo.org/record/5577054
Skolem mean labeling of the four star G = K K K K ∪ ∪ ∪ 1 1, ,η η 1,τ 1,τ 1 2 1 2 where 2 η η 1 and 1 2 is a skolem mean graph if 2 2 1 1 1 2 i i i i is the main purpose of this article
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::9705bc31edaaaf71787e973f8a27e3fe
https://zenodo.org/record/5577091
https://zenodo.org/record/5577091
The four star graphs G = K1,l where l3 will be relaxed skolem mean if = 1 is the main purpose of this article.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::1ebd4ffb8c58d0d06e381b44f06d3275
https://zenodo.org/record/5593918
https://zenodo.org/record/5593918
Autor:
D. S. T. Ramesh, J. P. Thavamani
Publikováno v:
Journal of Mathematical Sciences & Computer Applications. 1:78-84
A graph G (V, E) is said to be a sum graph if there exists a bijective labeling from the vertex set V to a set S of positive integers such that (x y) ∈ E if and only if f(x) + f(y) ∈ S. In this paper, for a given graph G (V, E), the edge function
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::91331318fff700860ff79b2593cee700
https://doi.org/10.5147/jmsca.v1i3.94
https://doi.org/10.5147/jmsca.v1i3.94
Publikováno v:
International Journal of Mathematics Trends and Technology. 38:99-105
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::327363d4c8a6903f54bcd7a48e31030c
https://doi.org/10.14445/22315373/ijmtt-v38p517
https://doi.org/10.14445/22315373/ijmtt-v38p517
Autor:
D. S. T. Ramesh, K. Jenita Devanesam
Publikováno v:
IOSR Journal of Mathematics. 12:49-53
A p 2 cordiallabeling of a graph G with p verticesisabijection f: V(G) {1, 2,3,..., p}definedby 1 (u) f(v) (e uv) 2 0 p if f f otherwise and f f e (0) e (1) 1
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::9eeb7e759f6ba56a5e7fda879552b324
https://doi.org/10.9790/5728-1205034953
https://doi.org/10.9790/5728-1205034953