Pandiaraj P

@kamarajengg.edu.in

Assistant Professor of Mathematics
Kamaraj College of Engineering and Techno;logy

Pandiaraj P


               Download Compact PDF  
https://researchid.co/pandiarajmaths

RESEARCH INTERESTS

Graph Theory
4

Scopus Publications

18

Scholar Citations

2

Scholar h-index

1

Scholar i10-index

Scopus Publications

  • Further Results on (a, d) -total Edge Irregularity Strength of Graphs
    K. Muthugurupackiam, P. Pandiaraj, R. Gurusamy, I. Muthuselvam
    Baghdad Science Journal, 2023
    Consider a simple graph 𝐺 = (𝑉, 𝐸) on 𝑙 vertices and 𝑚 edges together with a total ℎ – labeling 𝜌: 𝑉(𝐺) ∪ 𝐸(𝐺) → {1,2,3, … , ℎ} . Then ρ is called (𝑎, 𝑑)– total edge irregular labeling if there exists a one-to-one correspondence, say 𝜓: 𝐸(𝐺) → {𝑎, 𝑎 + 𝑑, 𝑎 + 2𝑑, … + 𝑎 + (𝑚 − 1)𝑑} defined by 𝜓(𝑢𝑣) = 𝜌(𝑢) + 𝜌(𝑣) + 𝜌(𝑢𝑣) for all 𝑢𝑣 ∈ 𝐸(𝐺), where 𝑎 ≥ 3, 𝑑 ≥ 2. Also, the value 𝜓(𝑢𝑣) is said to be the edge weight of 𝑢𝑣 . The (𝑎, 𝑑) − total edge irregularity strength of the graph G is indicated by (𝑎, 𝑑) − 𝑡𝑒𝑠(𝐺) and is the least ℎ for which G admits (𝑎, 𝑑) – edge irregular h-labeling. In this article, (𝑎, 𝑑) − 𝑡𝑒𝑠(𝐺) for some common graph families are examined. In addition, an open problem (3,2)– 𝑡𝑒𝑠(𝐾_(𝑚, 𝑛) ), 𝑚, 𝑛 > 2 is solved affirmatively.
  • On one modulo three mean labeling of graphs
    P. Jeyanthi, A. Maheswari, P. Pandiaraj
    Journal of Discrete Mathematical Sciences and Cryptography, 2016
    A graph G is said to be one modulo three mean graph if there is an injective function ϕ from the vertex set of G to the set {a | 0≤a≤3q – 2 and either a≡0 (mod 3) or a≡1 (mod 3)} where q is the number of edges of G and ϕ induces a bijection ϕ* from the edge set of G to {a | 1≤a≤3q – 2 and either a≡1 (mod3)} given by and the function ϕ is called one modulo three mean labeling of G. In this paper, we show that the graphs and Cm *e Cn are one modulo three mean graphs.
  • One modulo three mean labeling of transformed trees
    P Jeyanthi, A Maheswari, P Pandiaraj
    Proyecciones, 2016
    A graph G is said to be one modulo three mean graph if there is an injective function φ from the vertex set of G to the set {a|0 ≤ a ≤ 3q— 2 and either a ≡ 0(mod 3) or a ≡ 1(mod 3)} where q is the number of edges G and φ induces a bijection φ* from the edge set of G to {a|1 ≤ a ≤ 3q — 2 and either a ≡ 1(mod 3)} given byand the function φ is called one modulo three mean labeling of G. In this paper, we prove that the graphs T ° Kn, T o K1,n, T o Pn and T o 2Pn are one modulo three mean graphs.
  • One modulo three mean labeling of cycle related graphs
    P. Jeyanthi, A. Maheswari, P. Pandiaraj
    International Journal of Pure and Applied Mathematics, 2015
    The concept of one modulo three mean labeling was introduced in (2). In this paper, we prove that the graphs EJn, P4m(+)Kn,K1,2n × P2,NA(Qm),S ' (P2n),D(Cn,v ' ) and D(Cn,e ' ) are one modulo three mean graphs.

RECENT SCHOLAR PUBLICATIONS

  • Further Results on (a, d)-total Edge Irregularity Strength of Graphs
    K Muthugurupackiam, P Pandiaraj, I MUTHUSELVAM
    Baghdad Science Journal 20 (6 (Suppl.)), 2498-2498 , 2023
    2023
  • One modulo three geometric mean graphs
    P Jeyanthi, A Maheswari, P Pandiaraj
    Journal of Algorithms and Computation 50 (1), 101-108 , 2018
    2018
    Citations: 1
  • One modulo three mean labeling of transformed trees
    P Jeyanthi, A Maheswari, P Pandiaraj
    Proyecciones (Antofagasta) 35 (3), 277-289 , 2016
    2016
    Citations: 1
  • On one modulo three mean labeling of graphs
    P Jeyanthi, A Maheswari, P Pandiaraj
    Journal of Discrete Mathematical sciences and Cryptography 19 (2), 375-384 , 2016
    2016
    Citations: 5
  • One modulo three mean labeling of cycle related graphs
    PJA Maheswari, P Pandiaraj
    International Journal of Pure and Applied Mathematics 103 (4), 625-633 , 2015
    2015
    Citations: 11

MOST CITED SCHOLAR PUBLICATIONS

  • One modulo three mean labeling of cycle related graphs
    PJA Maheswari, P Pandiaraj
    International Journal of Pure and Applied Mathematics 103 (4), 625-633 , 2015
    2015
    Citations: 11
  • On one modulo three mean labeling of graphs
    P Jeyanthi, A Maheswari, P Pandiaraj
    Journal of Discrete Mathematical sciences and Cryptography 19 (2), 375-384 , 2016
    2016
    Citations: 5
  • One modulo three geometric mean graphs
    P Jeyanthi, A Maheswari, P Pandiaraj
    Journal of Algorithms and Computation 50 (1), 101-108 , 2018
    2018
    Citations: 1
  • One modulo three mean labeling of transformed trees
    P Jeyanthi, A Maheswari, P Pandiaraj
    Proyecciones (Antofagasta) 35 (3), 277-289 , 2016
    2016
    Citations: 1
  • Further Results on (a, d)-total Edge Irregularity Strength of Graphs
    K Muthugurupackiam, P Pandiaraj, I MUTHUSELVAM
    Baghdad Science Journal 20 (6 (Suppl.)), 2498-2498 , 2023
    2023