K.PRIYA BHANTHAVI

@sdnbvc.edu.in

Assistant Professor and B.Sc Mathematics
shrimathi Devkunvr Nanalal Bhatt Vaishnav College for Women

K.PRIYA BHANTHAVI


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

EDUCATION

M.Sc,

RESEARCH INTERESTS

Graph Theory
3

Scopus Publications

5

Scholar Citations

2

Scholar h-index

Scopus Publications

  • More on independent transversal domination
    P. Roushini Leely Pushpam, K. Priya Bhanthavi
    Discrete Mathematics Algorithms and Applications, 2024
    A set [Formula: see text] of vertices in a graph [Formula: see text] is called a dominating set if every vertex in [Formula: see text] is adjacent to a vertex in [Formula: see text]. Hamid defined a dominating set which intersects every maximum independent set in [Formula: see text] to be an independent transversal dominating set. The minimum cardinality of an independent transversal dominating set is called the independent transversal domination number of [Formula: see text] and is denoted by [Formula: see text]. In this paper we prove that for trees [Formula: see text], [Formula: see text] is bounded above by [Formula: see text] and characterize the extremal trees. Further, we characterize the class of all trees whose independent transversal domination number does not alter owing to the deletion of an edge.
  • The stability of independent transversal domination in trees
    P. Roushini Leely Pushpam, K. Priya Bhanthavi
    Discrete Mathematics Algorithms and Applications, 2021
    A set [Formula: see text] of vertices in a graph [Formula: see text] is called a dominating set if every vertex in [Formula: see text] is adjacent to a vertex in [Formula: see text]. An independent transversal dominating set in a graph [Formula: see text] is a dominating set which intersects every maximum independent set of [Formula: see text]. The minimum cardinality of an independent transversal dominating set is called the independent transversal domination number of [Formula: see text] denoted by [Formula: see text]. In this paper, we characterize those trees whose independent transversal domination number does not alter owing to the deletion of a vertex.
  • The Independent Transversal Dombondage Number of a Graph
    P. Roushini Leely Pushpam, K. Priya Bhanthavi
    Electronic Notes in Discrete Mathematics, 2016

RECENT SCHOLAR PUBLICATIONS

  • Independent transversal domination subdivision number of trees
    P Pushpam, KP Bhanthavi
    Communications in Combinatorics and Optimization 11 (2), 387-405 , 2026
    2026
    Citations: 1
  • independent transversal domination subdivision number of trees
    PRLKP Bhanthavi
    communications in combinatorics and optimization 23, 1to19 , 2024
    2024
  • More on independent transversal domination in trees
    PRL pushpam
    Discrete Mathematics Algorithms and Applications , 2023
    2023
  • The stability of independent transversal domination in trees
    P Roushini Leely Pushpam, K Priya Bhanthavi
    Discrete Mathematics, Algorithms and Applications 13 (01), 2050097 , 2021
    2021
    Citations: 2
  • The stability of Independent transversal domination in trees
    PRLPKP BHANTHAVI
    Discrete mathematics , Algorithms and applications 13 (1) , 2021
    2021
  • Independent transversal domination in some regular graphs
    PRLPKP BHANTHAVI
    Advances and applications in mathematical sciences 19 (2), 77-95 , 2019
    2019
  • Domatic Independent transversal domination in Graphs
    PRLPKP BHANTHAVI
    International journal of research and analytic reviews 6 (2) , 2019
    2019
  • The Independent Transversal Dombondage Number of a Graph
    PRL Pushpam, KP Bhanthavi
    Electronic Notes in Discrete Mathematics 53, 199-211 , 2016
    2016
    Citations: 2

MOST CITED SCHOLAR PUBLICATIONS

  • The stability of independent transversal domination in trees
    P Roushini Leely Pushpam, K Priya Bhanthavi
    Discrete Mathematics, Algorithms and Applications 13 (01), 2050097 , 2021
    2021
    Citations: 2
  • The Independent Transversal Dombondage Number of a Graph
    PRL Pushpam, KP Bhanthavi
    Electronic Notes in Discrete Mathematics 53, 199-211 , 2016
    2016
    Citations: 2
  • Independent transversal domination subdivision number of trees
    P Pushpam, KP Bhanthavi
    Communications in Combinatorics and Optimization 11 (2), 387-405 , 2026
    2026
    Citations: 1
  • independent transversal domination subdivision number of trees
    PRLKP Bhanthavi
    communications in combinatorics and optimization 23, 1to19 , 2024
    2024
  • More on independent transversal domination in trees
    PRL pushpam
    Discrete Mathematics Algorithms and Applications , 2023
    2023
  • The stability of Independent transversal domination in trees
    PRLPKP BHANTHAVI
    Discrete mathematics , Algorithms and applications 13 (1) , 2021
    2021
  • Independent transversal domination in some regular graphs
    PRLPKP BHANTHAVI
    Advances and applications in mathematical sciences 19 (2), 77-95 , 2019
    2019
  • Domatic Independent transversal domination in Graphs
    PRLPKP BHANTHAVI
    International journal of research and analytic reviews 6 (2) , 2019
    2019