A V Prajeesh

@nitc.ac.in

Senior Research Fellow
National Institute of Technology Calicut



              

https://researchid.co/avprajeesh

EDUCATION

in Mathematics and Scientific computing

RESEARCH INTERESTS

Algebraic Graph Theory, Graph labeling, Combinatorics

10

Scopus Publications

35

Scholar Citations

4

Scholar h-index

1

Scholar i10-index

Scopus Publications

  • A characterization of group vertex magic trees of diameter up to 5


  • Local antimagic chromatic number of certain classes of trees
    Sarath V S and A V Prajeesh
    IEEE
    Let G = (V, E) be a connected graph with |V| = <tex>$n$</tex> and | E| = m. A bijection <tex>$f$</tex> from <tex>$E$</tex> to the set of integers <tex>$\\{1, 2,\\ldots,\\ m\\}$</tex> is called a local antimagic labeling of <tex>$G$</tex> if for any two adjacent vertices <tex>$u$</tex> and <tex>$v$</tex> in G, w(u) is not equal to w(v), where <tex>$w$</tex>(u) is the sum of the labels of all the edges incident to u. Thus any local antimagic labeling induces a proper vertex coloring of <tex>$G$</tex> where the vertex <tex>$v$</tex> is assigned the color <tex>$w$</tex>(<tex>$v$</tex>). Also, the local antimagic chromatic number is defined to be the minimum number of colors taken over all colorings induced by local antimagic labelings of G. In this paper, the local antimagic chromatic number of diameter 3 trees, certain classes of diameter 4 trees and complete bipartite graph K<inf>m,n</inf> where <tex>$m$</tex> and <tex>$n$</tex> are of different parity are obtained.

  • Quasimagic rectangles
    D. Froncek, K. Paramasivam, and A. V. Prajeesh
    Wiley

  • (a,d)-distance antimagicness of disconnected 2-regnlar graphs
    A. V. Prajeesh, K. Muhammed Sabeel, and K. Paramasivam
    AIP Publishing

  • Maximal super edge-magic graph and its strength
    T. Sreehari, A. V. Prajeesh, Janitha Kolayil, and K. Paramasivam
    AIP Publishing

  • Note on group distance magicness of product graphs
    A. V. Prajeesh and K. Paramasivam

    In this paper, we provide few results on the group distance magic labeling of lexicographic product and direct product of two graphs. We also prove some necessary conditions for a graph to be group distance magic and provide a characterization for a tree to be group distance magic.

  • A Characterization for V<inf>4</inf> -Vertex Magicness of Trees with Diameter 5
    Muhammed Sabeel Kollaran, Appattu Vallapil Prajeesh, and Krishnan Paramasivam
    Springer Singapore

  • On distance magic Harary graphs


  • On group vertex magic graphs
    N. Kamatchi, K. Paramasivam, A.V. Prajeesh, K. Muhammed Sabeel, and S. Arumugam
    Informa UK Limited
    Abstract Let G = ( V ( G ) , E ( G ) ) be a simple undirected graph and let A be an additive abelian group with identity 0. A mapping l : V ( G ) → A ∖ { 0 } is said to be a A -vertex magic labeling of G if there exists an element μ of A such that w ( v ) = ∑ u ∈ N ( v ) l ( u ) = μ for any vertex v of G , where N ( v ) is the open neighborhood of v . A graph G that admits such a labeling is called an A -vertex magic graph. If G is A -vertex magic graph for any nontrivial abelian group A , then G is called a group vertex magic graph. In this paper, we obtain a few necessary conditions for a graph to be group vertex magic. Further, when A ≅ Z 2 ⊕ Z 2 , we give a characterization of trees with diameter at most 4 which are A -vertex magic.

  • A note on handicap incomplete tournaments
    Appattu Vallapil Prajeesh, Krishnan Paramasivam, and Nainarraj Kamatchi
    Springer International Publishing
    An equalized incomplete tournament EIT(p, r) on p teams which are ranked from 1 to p, is a tournament in which every team plays against r teams and the total strength of the opponents that every team plays with is a constant. A handicap incomplete tournament HIT(p, r) on p teams is a tournament in which every team plays against r opponents in such a way that

RECENT SCHOLAR PUBLICATIONS

  • Local antimagic chromatic number of certain classes of trees
    VS Sarath, AV Prajeesh
    2023 Second International Conference on Electrical, Electronics, Information 2023

  • A characterization of group vertex magic trees of diameter up to 5
    M. Sabeel, K Paramasivam, AV Prajeesh, N Kamatchi, S Arumugam
    AUSTRALASIAN JOURNAL OF COMBINATORICS (1), 49-60 85 (1), 49-60 2023

  • Quasimagic rectangles
    D Froncek, K Paramasivam, AV Prajeesh
    Journal of Combinatorial Designs 30 (3), 193-202 2022

  • (a, d)-distance antimagicness of disconnected 2-regular graphs
    AV Prajeesh, KM Sabeel, K Paramasivam
    AIP Conference Proceedings 2336 (1) 2021

  • Maximal super edge-magic graph and its strength
    T Sreehari, AV Prajeesh, J Kolayil, K Paramasivam
    AIP Conference Proceedings 2336 (1) 2021

  • Note on group distance magicness of product graphs
    AV Prajeesh, K Paramasivam
    Contributions to discrete mathematics 16 (1), 72-88 2021

  • A Characterization for -Vertex Magicness of Trees with Diameter 5
    MS Kollaran, AV Prajeesh, K Paramasivam
    International Conference on Computational Sciences-Modelling, Computing and 2020

  • On distance magic harary graphs
    AV Prajeesh, K Paramasivam, KM Kathiresan
    Utilitas Mathematica 115, 251-266 2020

  • On group vertex magic graphs
    N Kamatchi, K Paramasivam, AV Prajeesh, K Muhammed Sabeel, ...
    AKCE International Journal of Graphs and Combinatorics 17 (1), pp. 461-465 2020

  • A note on handicap incomplete tournaments
    AV Prajeesh, K Paramasivam, N Kamatchi
    International Workshop on Combinatorial Algorithms, 1-9 2019

MOST CITED SCHOLAR PUBLICATIONS

  • On group vertex magic graphs
    N Kamatchi, K Paramasivam, AV Prajeesh, K Muhammed Sabeel, ...
    AKCE International Journal of Graphs and Combinatorics 17 (1), pp. 461-465 2020
    Citations: 12

  • A characterization of group vertex magic trees of diameter up to 5
    M. Sabeel, K Paramasivam, AV Prajeesh, N Kamatchi, S Arumugam
    AUSTRALASIAN JOURNAL OF COMBINATORICS (1), 49-60 85 (1), 49-60 2023
    Citations: 7

  • Quasimagic rectangles
    D Froncek, K Paramasivam, AV Prajeesh
    Journal of Combinatorial Designs 30 (3), 193-202 2022
    Citations: 5

  • A Characterization for -Vertex Magicness of Trees with Diameter 5
    MS Kollaran, AV Prajeesh, K Paramasivam
    International Conference on Computational Sciences-Modelling, Computing and 2020
    Citations: 4

  • A note on handicap incomplete tournaments
    AV Prajeesh, K Paramasivam, N Kamatchi
    International Workshop on Combinatorial Algorithms, 1-9 2019
    Citations: 3

  • On distance magic harary graphs
    AV Prajeesh, K Paramasivam, KM Kathiresan
    Utilitas Mathematica 115, 251-266 2020
    Citations: 2

  • (a, d)-distance antimagicness of disconnected 2-regular graphs
    AV Prajeesh, KM Sabeel, K Paramasivam
    AIP Conference Proceedings 2336 (1) 2021
    Citations: 1

  • Note on group distance magicness of product graphs
    AV Prajeesh, K Paramasivam
    Contributions to discrete mathematics 16 (1), 72-88 2021
    Citations: 1