P.Nataraj

@sairam.edu.in

Assistant Professor, Department of Mathematics
Sri Sairam Engineering College

P.Nataraj


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

RESEARCH INTERESTS

Graph Theory
7

Scopus Publications

18

Scholar Citations

3

Scholar h-index

Scopus Publications

  • Equitable fair domination in graphs
    V. Swaminathan, R. Sundareswaran, D. Lakshmanaraj, P. Nataraj, L. Muthusubramanian
    Discrete Mathematics Algorithms and Applications, 2021
    Graphs considered here are simple, finite and undirected. A graph is denoted by [Formula: see text] and it has vertex set [Formula: see text] and edge set [Formula: see text]. Inspired by two concepts, this paper comes into existence. One is the degree equitability in graphs conceived by Prof. E. Sampathkumar and the other is fair domination (that is, vertices outside the dominating set are dominated by equal number of vertices) [Y. Caro, A. Hansberg and M. Henning, Fair domination in graphs, Discrete Math. 312 (2012) 2905–2914], Equitable fair domination is studied here.
  • Complementary equitably totally disconnected equitable domination in graphs
    P. Nataraj, R. Sundareswaran, V. Swaminathan
    Discrete Mathematics Algorithms and Applications, 2021
    In a simple, finite and undirected graph [Formula: see text] with vertex set [Formula: see text] and edge set [Formula: see text], a subset [Formula: see text] of [Formula: see text] is said to be a degree equitable dominating set if for every [Formula: see text] there exists a vertex [Formula: see text] such that [Formula: see text] and [Formula: see text], where [Formula: see text] denotes the degree of [Formula: see text] in [Formula: see text]. The minimum cardinality of such a dominating set is denoted by [Formula: see text] and is called the equitable domination number of [Formula: see text]. In this paper, we introduce Complementary Equitably Totally Disconnected Equitable domination in graphs and obtain some interesting results. Also, we discuss some bounds of this new domination parameter.
  • Equitably strong non-split equitable domination in graphs
    P. Nataraj, Sundareswaran Raman, V. Swaminathan
    Proyecciones, 2021
    In a simple, finite and undirected graph G with vertex set V and edge set E, Prof. Sampathkumar defined degree equitability among vertices of G. Two vertices u and v are said to be degree equitable if |deg(u) − deg(v)| ≤ 1. Equitable domination has been defined and studied in [7]. V.R.Kulli and B.Janakiram defined strong non - split domination in a graph [12]. In this paper, the equitable version of this new type of domination is studied
  • Outer connected equitable dominating sets in a graph
    South East Asian Journal of Mathematics and Mathematical Sciences, 2021
  • Outer connected resolving sets in a graph
    J. Sivakumar, A. Wilson Baskar, R. Sundareswaran, P. Nataraj, V. Swaminathan
    Advances in Mathematics Scientific Journal, 2021
    In this paper, we have constructed a sequence of soft points in one soft set with respect to a fixed soft point of another soft set.The convergence and boundedness of these sequences in soft ∆-metric spaces are defined and their properties are established.Further, the complete soft ∆-metric spaces are introduced by defining soft ∆-Cauchy sequences.
  • γe - Graphs of graphs
    South East Asian Journal of Mathematics and Mathematical Sciences, 2020
  • Super equitable domination in graphs
    P. Nataraj, A. Wilson Baskar, V. Swaminathan
    Advances in Mathematics Scientific Journal, 2020
    An equitable dominating set D of V (G) is called a super equitable dominating set of G if every vertex of V −D has a private equitable neighbour in D. This paper initiates the study of super equitable dominating set.

RECENT SCHOLAR PUBLICATIONS

  • Accurate Equitable Domination in Graphs
    VS P.Nataraj, A. Wilson Baskar
    Indian Journal of Natural Sciences 15 (83), 72743 - 72746 , 2024
    2024
  • Equitable fair domination in graphs
    V Swaminathan, R Sundareswaran, D Lakshmanaraj, P Nataraj, ...
    Discrete Mathematics, Algorithms and Applications 13 (06), 2150083 , 2021
    2021
    Citations: 8
  • Complementary equitably totally disconnected equitable domination in graphs
    P Nataraj, R Sundareswaran, V Swaminathan
    Discrete Mathematics, Algorithms and Applications 13 (04), 2150043 , 2021
    2021
    Citations: 4
  • Equitable Common Neighbour Equitable Domination in Graphs
    VS P.Nataraj, A.Wilson Baskar
    Indian Journal of Natural Sciences 12 (67), 32970-32975 , 2021
    2021
  • Outer Connected Equitable dominating sets in a graph
    VS P.Nataraj, A.Wilson Baskar
    South East Asian J. of Mathematics and Mathematical Sciences 17 (2), 215-244 , 2021
    2021
  • Equitably strong non-split equitable domination in graphs
    P Nataraj, R Sundareswaran, V Swaminathan
    Proyecciones (Antofagasta) 40 (4), 989-999 , 2021
    2021
    Citations: 1
  • OUTER CONNECTED RESOLVING SETS IN A GRAPH
    J Sivakumar, AW Baskar, R Sundareswaran, P Nataraj, V Swaminathan
    2021
    Citations: 4
  • γ e - GRAPHS OF GRAPHS.
    P Nataraj, AW Baskar, V Swaminathan
    South East Asian Journal of Mathematics & Mathematical Sciences 16 (2) , 2020
    2020
  • SUPER EQUITABLE DOMINATION IN GRAPHS
    P NATARAJ, AW BASKAR, V SWAMINATHAN
    2020
    Citations: 1
  • A NOTE ON AVERAGE DOMINATION AND AVERAGE INDEPENDENT DOMINATION NUMBERS IN GRAPHS
    AW Baskar, P Nataraj
    Bulletin of International Mathematical Virtual Institute 8 (3), 423-430 , 2018
    2018

MOST CITED SCHOLAR PUBLICATIONS

  • Equitable fair domination in graphs
    V Swaminathan, R Sundareswaran, D Lakshmanaraj, P Nataraj, ...
    Discrete Mathematics, Algorithms and Applications 13 (06), 2150083 , 2021
    2021
    Citations: 8
  • Complementary equitably totally disconnected equitable domination in graphs
    P Nataraj, R Sundareswaran, V Swaminathan
    Discrete Mathematics, Algorithms and Applications 13 (04), 2150043 , 2021
    2021
    Citations: 4
  • OUTER CONNECTED RESOLVING SETS IN A GRAPH
    J Sivakumar, AW Baskar, R Sundareswaran, P Nataraj, V Swaminathan
    2021
    Citations: 4
  • Equitably strong non-split equitable domination in graphs
    P Nataraj, R Sundareswaran, V Swaminathan
    Proyecciones (Antofagasta) 40 (4), 989-999 , 2021
    2021
    Citations: 1
  • SUPER EQUITABLE DOMINATION IN GRAPHS
    P NATARAJ, AW BASKAR, V SWAMINATHAN
    2020
    Citations: 1
  • Accurate Equitable Domination in Graphs
    VS P.Nataraj, A. Wilson Baskar
    Indian Journal of Natural Sciences 15 (83), 72743 - 72746 , 2024
    2024
  • Equitable Common Neighbour Equitable Domination in Graphs
    VS P.Nataraj, A.Wilson Baskar
    Indian Journal of Natural Sciences 12 (67), 32970-32975 , 2021
    2021
  • Outer Connected Equitable dominating sets in a graph
    VS P.Nataraj, A.Wilson Baskar
    South East Asian J. of Mathematics and Mathematical Sciences 17 (2), 215-244 , 2021
    2021
  • γ e - GRAPHS OF GRAPHS.
    P Nataraj, AW Baskar, V Swaminathan
    South East Asian Journal of Mathematics & Mathematical Sciences 16 (2) , 2020
    2020
  • A NOTE ON AVERAGE DOMINATION AND AVERAGE INDEPENDENT DOMINATION NUMBERS IN GRAPHS
    AW Baskar, P Nataraj
    Bulletin of International Mathematical Virtual Institute 8 (3), 423-430 , 2018
    2018