×

All ResearchIDs

---

×

All Publications

---

Journal(s)

• Complexity Issues Concerning the Quadruple Roman Domination Problem in Graphs, By P. Venkata Subba Reddy, Guru Pratap Sharma and Ismael Gonzalez Yero, Elsevier, Theoretical Computer Science, vol.1026, pp.115013, 2025
• Meta-heuristic Algorithms for Double Roman Domination Problem, By Himanshu Aggarwal and P. Venkata Subba Reddy, Elsevier, Applied Soft Computing, vol.154, pp.111306, 2024
• Metaheuristic Algorithms for Solving Roman {2}-Domination Problem, By Alfred Raju M and P. Venkata Subba Reddy, EDP Sciences, RAIRO-Operations Research, vol., pp., 2024
• Algorithmic Aspects of Outer-Independent Double Roman Domination in Graphs, By Amit Sharma, P. Venkata Subba Reddy, S. Arumugam, and Jakkepalli Pavan Kumar, World Scientific, International Journal of Foundations of Computer Science, vol., pp., 2024
• Total 2-Rainbow Domination in Graphs: Complexity and Algorithms, By Manjay Kumar and P. Venkata Subba Reddy, World Scientific, International Journal of Foundations of Computer Science, vol., pp., 2023
• Vertex-Edge Roman Domination in Graphs: Complexity and Algorithms, By Manjay Kumar and P. Venkata Subba Reddy, Azarbaijan Shahid Madani University, Iran, Communications in Combinatorics and Optimization, vol.8(1), pp.23-37, 2023
• Algorithmic Aspects of Total Roman {2}-Domination in Graphs, By P. Chakradhar and P. Venkata Subba Reddy, Azarbaijan Shahid Madani University, Iran, Communications in Combinatorics and Optimization, vol.7(2), pp.183-192, 2022
• Algorithmic Aspects of Outer Independent Roman Domination in Graphs, By Amit Sharma, J. Pavan Kumar, P. Venkata Subba Reddy and S. Arumugam, World Scientific, Discrete Mathematics, Algorithms and Applications, vol.14(5), pp.2250004, 2022
• Algorithmic Aspects of Roman {3}-Domination in Graphs, By P. Chakradhar and P. Venkata Subba Reddy, EDP Sciences, RAIRO - Operations Research, vol.56 (4), pp.2277 - 2291, 2022
• Algorithmic Aspects of Quasi-Total Roman Domination in Graphs, By Vikas Mangal and P. Venkata Subba Reddy, Azarbaijan Shahid Madani University, Iran, Communications in Combinatorics and Optimization, vol.7(1), pp.93-104, 2022
• Algorithmic Aspects of Certified Domination in Graphs, By J. Pavan Kumar, S. Arumugam, H. Khandelwal, and P. Venkata Subba Reddy, Azarbaijan Shahid Madani University, Iran, Communications in Combinatorics and Optimization, vol.7(2), pp.247-255, 2022
• Independent Roman {3}-Domination, By P. Chakradhar and P. Venkata Subba Reddy, University of Isfahan, Iran, Transactions on Combinatorics, vol.11(2), pp.99-110, 2022
• Algorithmic Aspects of 2-Secure Domination in Graphs, By J. Pavan Kumar and P. Venkata Subba Reddy, Springer, Journal of Combinatorial Optimization, vol.42, pp.56-70, 2021
• Complexity Issues of Perfect Secure Domination in Graphs, By P. Chakradhar and P. Venkata Subba Reddy, EDP Sciences, RAIRO - Theoretical Informatics and Applications, vol.55, pp.11, 2021
• Complexity Aspects of Variants of Independent Roman Domination in Graphs, By P. Chakradhar and P. Venkata Subba Reddy, Springer, Bulletin of the Iranian Mathematical Society, vol.47, pp.1715-1735, 2021
• Algorithmic Aspects of Outer-Independent Total Roman Domination in Graphs, By Amit Sharma and P. Venkata Subba Reddy, World Scientific, International Journal of Foundations of Computer Science, vol.32(3), pp.331-339, 2021
• Algorithmic Aspects of Total Roman {3}-Domination in Graphs, By P. Chakradhar and P. Venkata Subba Reddy, World Scientific, Discrete Mathematics, Algorithms and Applications, vol.13 (5), pp.2150063, 2021
• Algorithmic Complexity of Isolate Secure Domination in Graphs, By J. Pavan Kumar and P. Venkata Subba Reddy, Feyziye Schools Foundation Işik University, TWMS Journal of Applied and Engineering Mathematics, vol.11, pp.188-194, 2021
• Complexity Issues of Perfect Roman Domination in Graphs, By P. Chakradhar and P. Venkata Subba Reddy, Kyungpook National University, South Korea, Kyungpook Mathematical Journal, vol.61(3), pp.661-669, 2021
• Algorithmic Aspects of Secure Connected Domination in Graphs, By J. Pavan Kumar and P. Venkata Subba Reddy, DMGT, Discussiones Mathematicae Graph Theory, vol.41, pp.1179-1197, 2021
• Algorithmic Aspects of Roman Domination in Graphs, By P. Chakradhar and P. Venkata Subba Reddy, Springer, Journal of Applied Mathematics and Computing, vol.64, pp.89-102, 2020
• Algorithmic Aspects of Some Variants of Domination in Graphs, By J. Pavan Kumar and P. Venkata Subba Reddy, Sciendo, Analele Stiintifice ale Universitatii Ovidius Constanta, vol.28(3), pp.153-170, 2020
• Complexity of Roman {2}-Domination and the Double Roman Domination in Graphs, By P. Chakradhar and P. Venkata Subba Reddy, Taylor & Francis, AKCE International Journal of Graphs and Combinatorics, vol.17 (3), pp.1081-1086, 2020
• Algorithmic Complexity of Secure Connected Domination in Graphs, By J. Pavan Kumar, P. Venkata Subba Reddy and S. Arumugam, Taylor & Francis, AKCE International Journal of Graphs and Combinatorics, vol.17(3), pp.1010-1013, 2019
• Radio Number of {1, 2} - Cartesian Product of Paths, By Raaghave Sood and P. Venkata Subba Reddy, The Forum for Interdisciplinary Mathematics, Journal of Combinatorics, Information System Sciences, vol.41, pp.31-38, 2016
• A Note on D2CS and Conditional Coloring of Graphs, By P. Venkata Subba Reddy and K. Viswanathan Iyer, Institute Of Advanced Scientific Research, Journal of Advanced Research in Applied Mathematics, vol.4(3), pp., 2012
• Upper Bounds on the Radio Number of Some Trees, By P. Venkata Subba Reddy and K. Viswanathan Iyer, Academic Pubblications, International Journal of Pure and Applied Mathematics, vol.71(2), pp.207-215, 2011

Conference(s)

• Genetic Algorithm based Solution for Secure Domination Problem in Graphs By Sista Gopala Krishna and P. Venkata Subba Reddy, International Conference on Applied Mathematics and Mechanics, 2023
• Genetic Algorithm based Approach for Solving Roman 3- Domination Problem By Aditya Billore and P. Venkata Subba Reddy, IEEE International Conference on Computer, Electronics and Electrical Engineering and their Applications, 2023
• A Linear Algorithm for Super Domination in Trees By Jinish Raiyarela, Pratyush Chaudhary and P. Venkata Subba Reddy, International Conference on Mathematical Techniques in Engineering Applications, 2020
• Perfect Double Roman Domination in Graphs By P. Chakradhar and P. Venkata Subba Reddy, 28th International Conference of Forum for InterdisciplinaryMathematics: Synergies in Computational,Mathematical, Statistical and Physical Sciences, 2020
• A Note on Roman {2}-Domination Number of 𝑘th Power of Paths and Cycles By Attyuttam Saha and P. Venkata Subba Reddy, 28th International Conference of Forum for Interdisciplinary Mathematics: Synergies in Computational, Mathematical, Statistical and Physical Sciences,, 2020
• Algorithmic Complexity of Isolate Secure Domination in Graphs By J. Pavan Kumar and P. Venkata Subba Reddy, International Conference on Graph Theory and its Applications, 2019
• A Note on Domination Cover Number Different Graph Operations, of By K. Viswanathan Iyer, Sonu Seoran, Samarth Guptha and P. Venkata Subba Reddy, International Conference on Discrete Mathematics, 2019
• Double Roman Domination in Join, Corona and Rooted Product of Graphs By K. Viswanathan Iyer, Sukhdev Singh, Samarth Guptha and P. Venkata Subba Reddy, International Conference on Discrete Mathematics, 2019
• Computing Topological Indices and Polynomials of Some Nanostar Dendrimers By P. Venkata Subba Reddy, Deepakkumar V.Gupta and Aakanksha Here, Third International Conference on Mathematical Techniques in Engineering and Applications, 2018
• NewResults on Topological Indices of Graphs By Deepakkumar V.Gupta, P. Venkata Subba Reddy and Aakanksha Here, International Conference on Mathematical Methods, Modeling and Simulation in Chemical Sciences, 2018
• Complexity of Roman {2}-Domination and the Double Roman Domination in Graphs By P. Chakradhar and P. Venkata Subba Reddy, International Conference on Theoretical Computer Science and Discrete Mathematics, 2018
• A Note on Topological Indices of Trees By Deepakkumar V. Gupta and P. Venkata Subba Reddy, International Conference on Recent Advances in Pure and Applied Mathematics, 2018
• Parameterized Complexity of Variants of Connected Domination in Graphs By Deepakkumar V. Gupta and P. Venkata Subba Reddy, International Conference on Discrete Mathematics and its Applications to Network Science, 2018
• Complexity of New Variants of Secure Domination in Graphs By Kiran Dey and P. Venkata Subba Reddy, International Conference on Discrete Mathematics and its Applications to Network Science, 2018
• A Note on Secure Perfect Connected Domination in Graphs By Deepakkumar V. Gupta and P. Venkata Subba Reddy, International Conference on Recent Trends in Graph Theory and Combinatorics, 2018
• Complexity Issues of Variants of Secure Domination in Graphs By Devendra Lad, P. Venkata Subba Reddy and J. Pavan Kumar, International Conference on Current Trends in Graph Theory and Computation, 2016
• Bounding r-conditional Chromatic Number of Graphs By P. Venkata Subba Reddy and K. Viswanathan Iyer, 31st Annual Conference of the Ramanujan Mathematical Society, 2016
• A Note on 2-Secure Domination in Graphs By Rohit Kumar Tiwari and P. Venkata Subba Reddy, International Conference on Discrete Mathematics, 2016
• Conditional Coloring of Middle Graph of Wheel Graph By P. Venkata Subba Reddy and K. Viswanathan Iyer, 80th Annual Conference of the Indian Mathematical Society, 2014
• Radio Number of 1,2 - Cartesian Product of Paths By Raaghave Sood and P. Venkata Subba Reddy, 23rd International Conference of Forum for Interdisciplinary Mathematics, 2014
• Conditional and Unique Conditional Colorability of Graphs By P. Venkata Subba Reddy and K. Viswanathan Iyer, 18th Annual Cum 3rd International Conference of Gwalior Academy of Mathematical Sciences, 2013
• On the Radio Number of Graphs By P. Venkata Subba Reddy, Third International Conference on Advances in Engineering and Technology, 2012
• On Conditional Coloring of Some Graphs By P. Venkata Subba Reddy and K. Viswanathan Iyer, 6th Annual Conference of the Indian Mathematical Society, 2010
• Enumerating and Counting D2CS of Some Graphs By P. Venkata Subba Reddy and K. Viswanathan Iyer, 15th Annual Conference of Gwalior Academy of Mathematical Sciences, 2010
• Dynamic Star Coloring of Graphs By P. Venkata Subba Reddy, International Conference on Mathematical and Computational Models, 2009

Book Chapter(s)

• Algorithmic Aspects of Total Roman and Total Double Roman Domination in Graphs By Chakradhar Padamutham and Venkata Subba Reddy Palagiri in Algorithms and Discrete Applied Mathematics, Springer, CALDAM 2021 Proceedings, 2021

×

Previous Students

---