Krishan Paramasivam

@nitc.ac.in

Associate Professor, Department of Mathematics
National Institute of Technology Calicut, Kozhikode

Krishan Paramasivam


                           Download Compact PDF  
https://researchid.co/krishnan
Associate Professor of Department of Mathematics, National Institute of Technology Calicut, Kozhikode, India..

EDUCATION

Ph.D. from Indian Institute of Technology Madras

RESEARCH, TEACHING, or OTHER INTERESTS

Discrete Mathematics and Combinatorics, Algebra and Number Theory
12

Scopus Publications

47

Scholar Citations

4

Scholar h-index

2

Scholar i10-index

Scopus Publications

  • On HV-neighborhood group constant sum array
    Karthik S, Krishnan Paramasivam
    Discrete Mathematics, 2025
  • On the Existence of a Subgroup Magic Rectangle
    S. Karthik, Aruna Venkatesan, Krishnan Paramasivam
    Lecture Notes in Computer Science, 2025
  • A characterization of group vertex magic trees of diameter up to 5
    Australasian Journal of Combinatorics, 2023
  • Quasimagic rectangles
    D. Froncek, K. Paramasivam, A. V. Prajeesh
    Journal of Combinatorial Designs, 2022
    Abstract A quasimagic rectangle is an array with odd and even whose entries are , each appearing exactly once, such that the sum of every row is equal to a constant and the sum of every column is equal to a constant . In this article, we prove the existence of for all possible values of and , when . In addition, if , we prove that the condition is necessary and sufficient for the existence of .
  • Zero-divisor graph of semisimple group-rings
    Krishnan Paramasivam, K. Muhammed Sabeel
    Journal of Algebra and Its Applications, 2022
    Let [Formula: see text], [Formula: see text], [Formula: see text] denote the zero-divisor graph, compressed zero-divisor graph and annihilating ideal graph of a commutative ring [Formula: see text], respectively. In this paper, we prove that [Formula: see text] for a semisimple commutative ring [Formula: see text] and represent [Formula: see text] as a generalized join of a finite set of graphs. Further, we study the zero-divisor graph of a semisimple group-ring [Formula: see text] and proved several structural properties of [Formula: see text] and [Formula: see text], where [Formula: see text] is a field with [Formula: see text] elements and [Formula: see text] is a cyclic group with [Formula: see text] elements.
  • (a,d)-distance antimagicness of disconnected 2-regnlar graphs
    A. V. Prajeesh, K. Muhammed Sabeel, K. Paramasivam
    Aip Conference Proceedings, 2021
    A distance magic labeling of a graph G on p vertices is a bijection l from the vertex set of G to {1, 2, ···, p} such that for any vertex x of G, the weight of x, wG(x) = ∑v ∈ NG(x) l(v) is a constant. Further, if the weights of vertices of the graph G are in an arithmetic progression of the form a, a + d, …, a + (p – 1)d, then l is an (a, d)-distance antimagic labeling of the graph G. In this paper, we provide a partial solution to the problem on (a, d)-distance antimagicness of disconnected two regular graphs posted by Arumugam and Kamatchi [7].
  • Maximal super edge-magic graph and its strength
    T. Sreehari, A. V. Prajeesh, Janitha Kolayil, K. Paramasivam
    Aip Conference Proceedings, 2021
    A (p, q)-graph G is known as super edge-magic if there exists a bijection f from V (G) ∪ E(G) to {1, …, p + q} in such a way that, for any edge uv of G, f (u) + f (v) + f (uv) = c f, is a constant and f (v) ∈ {1, …, p}. Such an f is called a super edge-magic labeling of G and c f is called the super edge-magic constant of G. The strength of a super edge-magic graph G is the minimum of all such c f ’s where the minimum is taken over all super edge-magic labeling f of G. If G is a (p, q)-super edge-magic graph, then we have that q ≤ 2p − 3. Further, any super edge-magic graph G is maximal if q = 2p − 3. In this paper, we give a characterization for any connected triangle-free graph G to attain the lower bound of its super edge-magic strength. Moreover, we determine the strength of certain well-known classes of maximal super edge-magic graphs with girth less than 4.
  • Note on group distance magicness of product graphs
    A. V. Prajeesh, K. Paramasivam
    Contributions to Discrete Mathematics, 2021
    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 V4 -Vertex Magicness of Trees with Diameter 5
    Muhammed Sabeel Kollaran, Appattu Vallapil Prajeesh, Krishnan Paramasivam
    Communications in Computer and Information Science, 2021
  • On distance magic Harary graphs
    Utilitas Mathematica, 2020
  • On group vertex magic graphs
    N. Kamatchi, K. Paramasivam, A.V. Prajeesh, K. Muhammed Sabeel, S. Arumugam
    Akce International Journal of Graphs and Combinatorics, 2020
  • A note on handicap incomplete tournaments
    Appattu Vallapil Prajeesh, Krishnan Paramasivam, Nainarraj Kamatchi
    Lecture Notes in Computer Science Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics, 2019

RECENT SCHOLAR PUBLICATIONS

  • Structural properties of subgroup magic rectangles
    S Karthik, V Aruna, K Paramasivam
    Acta Informatica Vol. xx, page xx-xx, 2026 (accepted) , 2026
    2026
  • On determining number and metric dimension of zero-divisor graph of semisimple rings
    M Sabeel K, K Paramasivam
    Ars Combinatoria, Vol. xxx, page xx-xx, 2026 (accepted) , 2026
    2026
  • On the existence of a subgroup magic rectangle
    S Karthik, V Aruna, K Paramasivam
    Combinatorial Algorithms, IWOCA 2025, Bozeman, USA, 15885, 332-346 , 2025
    2025
  • On HV-neighborhood group constant sum array
    S Karthik, K Paramasivam
    Discrete Mathematics 348 (7), 114456 , 2025
    2025
  • On zero-divisor graph of the ring of Gaussian integers modulo
    V Aruna, K Paramasivam
    arXiv preprint arXiv:2504.02493 , 2025
    2025
  • On determining number and metric dimension of zero-divisor graphs
    M Sabeel. K, K Paramasivam
    arXiv preprint arXiv:2308.00796 , 2023
    2023
  • Group vertex magicness of product graphs and trees
    K Paramasivam, M Sabeel K
    arXiv preprint arXiv:2302.10554 , 2023
    2023
  • A characterization of group vertex magic trees of diameter up to 5
    M Sabeel K, K Paramasivam, AV Prajeesh, N Kamatchi, S Arumugam
    Australasian Journal of Combinatorics 85 (1), 49-60 , 2023
    2023
    Citations: 10
  • A note on distance magic index of partite graphs
    E Srinivasan, AV Prajeesh, K Paramasivam
    arXiv preprint arXiv:2209.00997 , 2022
    2022
  • Zero-divisor graph of semisimple group-rings
    K Paramasivam, KM Sabeel
    Journal of Algebra and Its Applications 21 (02), 2250028 , 2022
    2022
    Citations: 1
  • Quasimagic rectangles
    D Froncek, K Paramasivam, AV Prajeesh
    Journal of Combinatorial Designs 30 (3), 193-202 , 2022
    2022
    Citations: 5
  • (a, d)-distance antimagicness of disconnected 2-regular graphs
    AV Prajeesh, M Sabeel K, K Paramasivam
    AIP Conference Proceedings 2336, pp: 050007(1-6) (2021) , 2021
    2021
    Citations: 1
  • Maximal super edge-magic graph and its strength
    AV Prajeesh, J Kolayil, K Paramasivam
    AIP Conference Proceedings 2336, pp: 050006(1-7) (2021) , 2021
    2021
  • Note on group distance magicness of product graphs
    KP Appattu Vallapil Prajeesh
    Contributions to Discrete Mathematics 16 (1), 72-88 , 2021
    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
    2020
    Citations: 4
  • On distance magic Harary graphs
    AV Prajeesh, K Paramasivam, KM Kathiresan
    Utilitas Mathematica 115, 251-266 , 2020
    2020
    Citations: 2
  • On group vertex magic graphs
    N Kamatchi, K Paramasivam, AV Prajeesh, K M Sabeel, S Arumugam
    AKCE International Journal of Graphs and Combinatorics 17 (1), 461-465 , 2020
    2020
    Citations: 14
  • A note on handicap incomplete tournaments
    AV Prajeesh, K Paramasivam, N Kamatchi
    Combinatorial Algorithms, IWOCA 2019, Pisa, Italy. 11638, 1-9 , 2019
    2019
    Citations: 3
  • On distance magic Harary graphs
    AV Prajeesh, K Paramasivam
    arXiv preprint arXiv:1809.07382 , 2018
    2018
    Citations: 2
  • Notes on group distance magicness of product graphs
    AV Prajeesh, K Paramasivam
    arXiv preprint arXiv:1808.01631 , 2018
    2018
    Citations: 1

MOST CITED SCHOLAR PUBLICATIONS

  • On group vertex magic graphs
    N Kamatchi, K Paramasivam, AV Prajeesh, K M Sabeel, S Arumugam
    AKCE International Journal of Graphs and Combinatorics 17 (1), 461-465 , 2020
    2020
    Citations: 14
  • A characterization of group vertex magic trees of diameter up to 5
    M Sabeel K, K Paramasivam, AV Prajeesh, N Kamatchi, S Arumugam
    Australasian Journal of Combinatorics 85 (1), 49-60 , 2023
    2023
    Citations: 10
  • Quasimagic rectangles
    D Froncek, K Paramasivam, AV Prajeesh
    Journal of Combinatorial Designs 30 (3), 193-202 , 2022
    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
    2020
    Citations: 4
  • A note on handicap incomplete tournaments
    AV Prajeesh, K Paramasivam, N Kamatchi
    Combinatorial Algorithms, IWOCA 2019, Pisa, Italy. 11638, 1-9 , 2019
    2019
    Citations: 3
  • Super edge magic strength of some new classes of graphs-II
    K Paramasivam
    Graphs, Combinatorics, Algorithms and Applications, 79-83 , 2005
    2005
    Citations: 3
  • Super magic strength of some new classes of graphs
    KM Kathiresan, K Paramasivam
    ANJAC Journal of Sciences 1 (2), 5–10 , 2002
    2002
    Citations: 3
  • On distance magic Harary graphs
    AV Prajeesh, K Paramasivam, KM Kathiresan
    Utilitas Mathematica 115, 251-266 , 2020
    2020
    Citations: 2
  • On distance magic Harary graphs
    AV Prajeesh, K Paramasivam
    arXiv preprint arXiv:1809.07382 , 2018
    2018
    Citations: 2
  • Zero-divisor graph of semisimple group-rings
    K Paramasivam, KM Sabeel
    Journal of Algebra and Its Applications 21 (02), 2250028 , 2022
    2022
    Citations: 1
  • (a, d)-distance antimagicness of disconnected 2-regular graphs
    AV Prajeesh, M Sabeel K, K Paramasivam
    AIP Conference Proceedings 2336, pp: 050007(1-6) (2021) , 2021
    2021
    Citations: 1
  • Notes on group distance magicness of product graphs
    AV Prajeesh, K Paramasivam
    arXiv preprint arXiv:1808.01631 , 2018
    2018
    Citations: 1
  • Structural properties of subgroup magic rectangles
    S Karthik, V Aruna, K Paramasivam
    Acta Informatica Vol. xx, page xx-xx, 2026 (accepted) , 2026
    2026
  • On determining number and metric dimension of zero-divisor graph of semisimple rings
    M Sabeel K, K Paramasivam
    Ars Combinatoria, Vol. xxx, page xx-xx, 2026 (accepted) , 2026
    2026
  • On the existence of a subgroup magic rectangle
    S Karthik, V Aruna, K Paramasivam
    Combinatorial Algorithms, IWOCA 2025, Bozeman, USA, 15885, 332-346 , 2025
    2025
  • On HV-neighborhood group constant sum array
    S Karthik, K Paramasivam
    Discrete Mathematics 348 (7), 114456 , 2025
    2025
  • On zero-divisor graph of the ring of Gaussian integers modulo
    V Aruna, K Paramasivam
    arXiv preprint arXiv:2504.02493 , 2025
    2025
  • On determining number and metric dimension of zero-divisor graphs
    M Sabeel. K, K Paramasivam
    arXiv preprint arXiv:2308.00796 , 2023
    2023
  • Group vertex magicness of product graphs and trees
    K Paramasivam, M Sabeel K
    arXiv preprint arXiv:2302.10554 , 2023
    2023
  • A note on distance magic index of partite graphs
    E Srinivasan, AV Prajeesh, K Paramasivam
    arXiv preprint arXiv:2209.00997 , 2022
    2022