Article Per Year (5 Year)
p-Index From 2021 - 2026
0.23
P-Index
This Author published in this journals
All Journal Indonesian Journal of Combinatorics
Ramalakshmi Rajendran
Rajapalayam Rajus' college
Computer Science & IT Decision Sciences, Operations Research & Management

Published : 2 Documents Claim Missing Document
Claim Missing Document
Check
Articles

Found 2 Documents
Search

 1 
On (a,d)-antimagic labelings of Hn, FLn and mCn Ramalakshmi Rajendran; K. M. Kathiresan
Indonesian Journal of Combinatorics Vol 4, No 2 (2020)
Publisher : Indonesian Combinatorial Society (InaCombS)

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.19184/ijc.2020.4.2.3

Abstract

In this paper, we derive the necessary condition for an (a,d )- antimagic labeling of some new classes of graphs such as Hn, F Ln and mCn. We prove that Hn is (7n +2, 1)-antimagic and mCn is ((mn+3)/2,1)- antimagic. Also we prove that F Ln has no ((n+1)/2,4)- antimagic labeling.
Total edge irregularity strength of some cycle related graphs Ramalakshmi Rajendran; Kathiresan KM
Indonesian Journal of Combinatorics Vol 5, No 1 (2021)
Publisher : Indonesian Combinatorial Society (InaCombS)

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.19184/ijc.2021.5.1.3

Abstract

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 distinct. The total edge irregularity strength tes(G) is defined as the minimum k for which the graph G has an edge irregular total k-labeling. In this paper, we determine the total edge irregularity strength of new classes of graphs Cm @ Cn, Pm,n* and Cm,n* and hence we extend the validity of the conjecture tes(G) = max {⌈|E(G)|+2)/3⌉, ⌈(Δ(G)+1)/2⌉}  for some more graphs.
Co-Authors K. M. Kathiresan Kathiresan KM