Graphs whose acyclic graphoidal covering number is one less than its maximum degree. - S. Arumugam 001; Indra Rajasingh; P. Roushini Leely Pushpam (Discret. Math., 2001)

On Graphs Whose Acyclic Graphoidal Covering Number Is One Less Than Its Cyclomatic Number. - S. Arumugam; Indra Rajasingh; P. Roushini Leely Pushpam (Ars Comb., 2004)

Weak edge Roman domination in graphs. - P. Roushini Leely Pushpam; T. N. M. Malini Mai (Australas. J Comb., 2011)

Weak Roman domination in graphs. - T. N. M. Malini Mai; P. Roushini Leely Pushpam (Discuss. Math. Graph Theory, 2011)

On super (a, d)-edge antimagic total labeling of certain families of graphs. - P. Roushini Leely Pushpam; A. Saibulla (Discuss. Math. Graph Theory, 2012)

Secure Restrained Domination in Graphs. - P. Roushini Leely Pushpam; Chitra Suseendran (Math. Comput. Sci., 2015)

On Total Roman Domination in Graphs. - P. Roushini Leely Pushpam; Padmapriea Sampath (ICTCSDM, 2016)

Restrained Differential of a Graph. - P. Roushini Leely Pushpam; D. Yokesh (ICTCSDM, 2016)

Global Roman domination in graphs. - P. Roushini Leely Pushpam; Padmapriea Sampath (Discret. Appl. Math., 2016)

m-Eternal total domination in graphs. - P. Roushini Leely Pushpam; Pa. Shanthi (Discret. Math. Algorithms Appl., 2016)

The Independent Transversal Dombondage Number of a Graph. - P. Roushini Leely Pushpam; K. Priya Bhanthavi (Electron. Notes Discret. Math., 2016)

Changing and Unchanging in m-Eternal Total Domination in Graphs. - P. Roushini Leely Pushpam; Pa. Shanthi (Electron. Notes Discret. Math., 2016)

Secure vertex cover of a graph. - P. Roushini Leely Pushpam; Chitra Suseendran (Discret. Math. Algorithms Appl., 2017)

m-Secure vertex cover of a graph. - P. Roushini Leely Pushpam; Chitra Suseendran (Discret. Math. Algorithms Appl., 2018)

Effect of vertex deletion on the weak Roman domination number of a graph. - P. Roushini Leely Pushpam; M. Kamalam (AKCE Int. J. Graphs Comb., 2019)

Weak Roman Bondage Number of a Graph. - P. Roushini Leely Pushpam; N. Srilakshmi (CALDAM, 2020)

An algorithm to recognize weak roman domination stable trees under vertex deletion. - B. Mahavir; P. Roushini Leely Pushpam; M. Kamalam (Discret. Math. Algorithms Appl., 2020)

The stability of independent transversal domination in trees. - P. Roushini Leely Pushpam; K. Priya Bhanthavi (Discret. Math. Algorithms Appl., 2021)

Resolving Roman domination in graphs. - P. Roushini Leely Pushpam; B. Mahavir; M. Kamalam (Discret. Math. Algorithms Appl., 2022)

Weak Roman subdivision number of graphs. - P. Roushini Leely Pushpam; N. Srilakshmi (Discret. Math. Algorithms Appl., 2022)

Stability of certified domination upon edge addition. - P. Roushini Leely Pushpam; M. Kamalam; B. Mahavir (Discret. Math. Algorithms Appl., 2024)

More on independent transversal domination. - P. Roushini Leely Pushpam; K. Priya Bhanthavi (Discret. Math. Algorithms Appl., 2024)