P. Roushini Leely Pushpam

According to our database, P. Roushini Leely Pushpam authored at least 20 papers between 2001 and 2022.

Collaborative distances:

• Dijkstra number of six.
• Erdős number of four.

2022

Weak Roman subdivision number of graphs.

P. Roushini Leely Pushpam, N. Srilakshmi

Discret. Math. Algorithms Appl., 2022

Resolving Roman domination in graphs.

P. Roushini Leely Pushpam, B. Mahavir, M. Kamalam

Discret. Math. Algorithms Appl., 2022

2021

The stability of independent transversal domination in trees.

P. Roushini Leely Pushpam, K. Priya Bhanthavi

Discret. Math. Algorithms Appl., 2021

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

Weak Roman Bondage Number of a Graph.

P. Roushini Leely Pushpam, N. Srilakshmi

Proceedings of the Algorithms and Discrete Applied Mathematics, 2020

2019

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

2018

m-Secure vertex cover of a graph.

P. Roushini Leely Pushpam, Chitra Suseendran

Discret. Math. Algorithms Appl., 2018

2017

Secure vertex cover of a graph.

P. Roushini Leely Pushpam, Chitra Suseendran

Discret. Math. Algorithms Appl., 2017

2016

Changing and Unchanging in m-Eternal Total Domination in Graphs.

P. Roushini Leely Pushpam, Pa. Shanthi

Electron. Notes Discret. Math., 2016

The Independent Transversal Dombondage Number of a Graph.

P. Roushini Leely Pushpam, K. Priya Bhanthavi

Electron. Notes Discret. Math., 2016

m-Eternal total domination in graphs.

P. Roushini Leely Pushpam, Pa. Shanthi

Discret. Math. Algorithms Appl., 2016

Global Roman domination in graphs.

P. Roushini Leely Pushpam, Padmapriea Sampath

Discret. Appl. Math., 2016

Restrained Differential of a Graph.

P. Roushini Leely Pushpam, D. Yokesh

Proceedings of the Theoretical Computer Science and Discrete Mathematics, 2016

On Total Roman Domination in Graphs.

P. Roushini Leely Pushpam, Padmapriea Sampath

Proceedings of the Theoretical Computer Science and Discrete Mathematics, 2016

2015

Secure Restrained Domination in Graphs.

P. Roushini Leely Pushpam, Chitra Suseendran

Math. Comput. Sci., 2015

2012

On super <i>(a, d)</i>-edge antimagic total labeling of certain families of graphs.

P. Roushini Leely Pushpam, A. Saibulla

Discuss. Math. Graph Theory, 2012

2011

Weak Roman domination in graphs.

T. N. M. Malini Mai, P. Roushini Leely Pushpam

Discuss. Math. Graph Theory, 2011

Weak edge Roman domination in graphs.

P. Roushini Leely Pushpam, T. N. M. Malini Mai

Australas. J Comb., 2011

2004

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

2001

Graphs whose acyclic graphoidal covering number is one less than its maximum degree.

S. Arumugam, Indra Rajasingh, P. Roushini Leely Pushpam

Discret. Math., 2001