Zobrazeno 1 - 10
of 27
pro vyhledávání: '"Kathiresan, KM."'
Autor:
Ramalakshmi Rajendran, Kathiresan KM
Publikováno v:
Indonesian Journal of Combinatorics, Vol 5, Iss 1, Pp 17-25 (2021)
An edge irregular total k-labeling f : V ∪ E → 1,2, ..., k of a graph G = (V,E) is a labeling of vertices and edges of G in such a way that for any two different edges uv and u'v', their weights f(u)+f(uv)+f(v) and f(u')+f(u'v')+f(v') are distinc
Externí odkaz:
https://doaj.org/article/4cd401f7d5f547d58f63bfeafa7b8d47
Autor:
Meenakshi, C., Kathiresan, KM.
Publikováno v:
In AKCE International Journal of Graphs and Combinatorics August 2019 16(2):125-144
Autor:
KATHIRESAN, KM., MUTHUKAMATCHI, R.
Publikováno v:
TWMS Journal of Applied & Engineering Mathematics; 2024, Vol. 14 Issue 1, p223-235, 13p
Autor:
David Laurence, S., Kathiresan, KM.
Publikováno v:
In AKCE International Journal of Graphs and Combinatorics July 2015 12(1):54-58
Autor:
RAMALAKSHMI, R., KATHIRESAN, KM.
Publikováno v:
Kragujevac Journal of Mathematics; 2022, Vol. 46 Issue 6, p895-903, 9p
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.
Autor:
Kathiresan, KM, Sabarimalai Madha, S
A graph G is called edge - magic if there is a bijec- tive function f : V (G)∪E(G) → {1, 2, . . . , |V (G)|+|E(G)|} such that for every edge xy ∈ E(G), f(x) + f(xy) + f(y) = c is a con- stant, called the valence of f. A graph G is said to be su
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::7593f8d6c198b4629147a22325a77854
Autor:
KATHIRESAN, KM.1 kathir2esan@yahoo.com, MARIMUTHU, G.2 yellowmuthu@yahoo.com, PARAMESWARAN, C.3 parames65c@yahoo.com
Publikováno v:
Discussiones Mathematicae: Graph Theory. 2014, Vol. 34 Issue 4, p829-848. 3p.
Autor:
Lenin, R.1, Kathiresan, KM.1
Publikováno v:
Journal of Discrete Mathematical Sciences & Cryptography. Aug2017, Vol. 20 Issue 5, p1091-1100. 10p.
Autor:
KATHIRESAN, KM.1 kathir2esan@yahoo.com, LAURENCE, S. DAVID2 danipravin@yahoo.co.in
Publikováno v:
Discussiones Mathematicae: Graph Theory. 2015, Vol. 35 Issue 4, p8-9. 2p.