Savari Prabhu

Scopus Publications

Metric dimension of cycloparaphenylene and its derived molecular structures
S. Prabhu, D. Sagaya Rani Jeba, M. Arulperumjothi, Paul Manuel
Scientific Reports, 2026
A chemical graph is a mathematical depiction of a chemical molecule utilizing graph theory. It abstracts molecules by representing atoms as vertices and chemical bonds as edges. Each atom can be distinctly identified by measuring distances to a limited collection of reference atoms known as the resolving set, the minimal cardinality of which is referred to as the metric dimension. This parameter can aid in differentiating isomers or examining molecular symmetry. Highly symmetric molecules typically exhibit reduced metric dimensions, as fewer vertices are required to distinctly define all positions, which is advantageous in cheminformatics. This parameter is investigated for cycloparaphenylene, pyrene-containing π-extended carbon nanorings, cycloparaphenylene nanorings functionalised with graphenic hexabenzocoronene sidewalls, and polythiophene molecular structures.
Average distance between the processors of biswapped networks
S. Prabhu, M. Anitha, N. Harish Vidyarth, Paul Manuel
Scientific Reports, 2026
Biswapped networks provide an efficient way to interconnect nodes through transpose like operations that balance both connectivity and performance. A biswapped network is constructed by systematically biswapping edges within a base graph [Formula: see text], thereby preserving essential connectivity properties while enhancing structural symmetry. This improved symmetry contributes to fault tolerance and energy efficiency, making biswapped networks a promising model for robust network design. In this study, we investigate the sum of distances from a particular node to all others, the transmission of a node in a biswapped network, which is a key indicator of communication cost which helps to compute the novel distance based descriptor Wiener index. Furthermore, we analyze transmission values of biswapped networks derived from various base graphs. Finally, the average distance between the nodes of biswapped networks constructed by various base graphs were investigated.
Fault-tolerant resolving power domination of fractal cubic network
S. Prabhu, A.K. Arulmozhi, Michael A. Henning, M. Arulperumjothi
Journal of Parallel and Distributed Computing, 2026
Topological, Graph-Spectral Properties, NMR and ESR Spectral Patterns of Hydrogen-Bonded Nanosheets of Boric Acid
S. Prabhu, J. Sahaya Vijay, V. Manimozhi, Micheal Arockiaraj, S. Roy, J. Celin Fiona, Krishnan Balasubramanian
Journal of Cluster Science, 2026
Edge metric dimension of silicate networks
Communications in Combinatorics and Optimization, 2026
The Central Metric Dimension of the k-Corona Graph
Liliek Susilowati, Anis Nur Fitria, Inna Kuswandari, Savari Prabhu, Darmaji
Statistics Optimization and Information Computing, 2026
The metric dimension is the minimum cardinality of a subset of the vertex set of a graph that uniquely represents each vertex in a graph. The central set is a set of vertices with minimum eccentricity. This central set concept can be used to determine strategic public service locations, such that accessible transportation can be reached from all regions. The central metric dimension is the minimum cardinality of a resolving set that includes the central set. This study aims to determine the central metric dimension in k-corona graph. The k-corona operation of G and H denoted by GoH is a generalization of the corona operation, where a new graph is formed by connecting each vertex of a graph G to k copies of graph H. The results show that the central metric dimension of the k-corona graph depends on the central set of G , the order of G , the value of k, and the metric dimension of H .
Fault-tolerant basis and fault-tolerant edge basis of three classes of French windmill graphs
S. Prabhu, P. Angelin Kiruba, A. Davoodi, Paul Manuel
Ain Shams Engineering Journal, 2026
A resolving set is a subset of vertices that uniquely identifies every vertex based on distances. A fault-tolerant resolving set maintains this condition under any single-vertex removal, and the minimum size of such a set is the fault-tolerant metric dimension. Similarly, the edge metric dimension is defined as the minimum number of vertices required to distinguish all edge pairs, and its fault-tolerant variant ensures resiliency against node failures. Interconnection networks, which model parallel architectures, are naturally represented by graphs where vertices correspond to processing nodes and edges denote communication links. Among these, the windmill graph is a well-studied topology formed by joining several copies of a complete graph at a shared central vertex. In this work, we determine the exact values of the fault-tolerant metric dimension and fault-tolerant edge metric dimension for the French windmill graph and its subcases, providing insights into the structural robustness of such networks.
Metric dimension of star fan graph
S. Prabhu, D. Sagaya Rani Jeba, Sudeep Stephen
Scientific Reports, 2025
Every node in a network is said to be resolved if it can be uniquely identified by a vector of distances to a specific set of nodes. The metric dimension is equivalent to the least possible cardinal number of a resolving set. Conditional resolving sets are obtained by imposing various constraints on resolving set. It is a fundamental parameter that provides insights into the structural properties and navigability of graphs, with diverse applications across different fields. This article focuses on identifying the metric dimension for a new network, star fan graph.
Molecular characterization and information entropies of chevron-like graphene nanoribbons with chemical applications
S. Manikanda Prabhu, A. R. Vijayalakshmi, S. Govardhan, S. Prabhu
Scientific Reports, 2025
Carbon-based nanomaterials, such as graphene and graphene nanoribbons (GNRs), have attracted researchers because of their optoelectronic properties. One of the most intriguing properties of GNRs is their tunable bandgap. Unlike inherently metallic graphene sheets, GNRs can exhibit a bandgap, a crucial property for electronic devices. By controlling the width and edge configuration of GNRs, researchers can precisely tailor their electronic properties to meet specific requirements. Chevron-like graphene nanoribbons (ChGNRs) are a class of nanomaterials with unique properties due to their wavy morphology. The electrical conductivity of ChGNRs makes them potentially useful in devices like organic solar cells and transistors. In this study, we computed the Shannon's information entropy measures of ChGNRs using a variety of degree-based topological descriptors (TDs). The basic graph theoretical approach was utilized to derive the explicit mathematical equations of the TDs for the ChGNRs. The results were compared with cove-edged graphene nanoribbons (cGNRs) to analyze the thermodynamic stability of both ChGNRs and cGNRs and the different trends were pointed out.
Acyclic and star coloring parameters of fractal cubic networks
C. Renuga, D. Meiyappan, S. Prabhu, M. Arulperumjothi
Scientific Reports, 2025
Interconnection networks are more vital in telecommunications because of the significant raise in the demand for high-speed networks as a result of the widespread use of computers and the growth of the internet. The hypercube is a versatile network with outstanding qualities that are important for developing extensively in parallel and distributed systems, which include smaller size diameter, recursive structure, symmetry, regularity, low degree, and scalability. In the realm of distributed systems, scalability is seen as an elasticity component of interconnection networks. Fractal cubic networks, a new and novel variant of hypercubes, were recently investigated and have very important qualities such as scalability and better bisection width than traditional hypercubes. The task of assigning channels can be represented as a graph coloring problem. The vertices of a graph represent the transmitters, and if two transmitters are in close proximity to each other, their corresponding vertices are considered nearby. Wavelength assignment enhances the efficiency of wavelength-routed networks by determining routes and assigning wavelengths to connection requests while adhering to network topology and wavelength constraints. Investigation of the acyclic, acyclic edge, star, and star edge chromatic numbers for this newly proposed interconnection network, which is in striking contrast to the situation with hypercubes, where these invariants are intrinsically difficult. In this paper, we establish that for Fractal Cubic Networks (FCNs), the acyclic chromatic number is [Formula: see text] for [Formula: see text]. Additionally, for [Formula: see text], the star chromatic number [Formula: see text] and the acyclic edge chromatic number [Formula: see text] are both 4, while the star edge chromatic number is [Formula: see text].
On some counting polynomials and energy properties of superphenalene and supertriphenylene
M. Arulperumjothi, Visalakshi Subramanian, S. Prabhu, Muhammad Imran
Scientific Reports, 2025
Topological and entropic characterization of nitrogenated holey graphene
S. Prabhu, M. Arulperumjothi, N. Jose Parvin Praveena, Paul Manuel
Scientific Reports, 2025
Metric dimensions of generalized Sierpiński graphs over squares
S. Prabhu, T. Jenifer Janany, Sandi Klavžar
Applied Mathematics and Computation, 2025
Edge metric basis and its fault tolerance over certain interconnection networks
S. Prabhu, T. Jenifer Janany, M. Arulperumjothi, I.G. Yero
Journal of Parallel and Distributed Computing, 2025
Molecular Characterization of Three Classes of Bow-Tie-Shaped Graphene Nanoflakes by Polynomials as Alternative for Their Computed Energies and Spectral Patterns
Savari Prabhu, Murugan Arulperumjothi, Lorentz Jäntschi, Venkatapathy Manimozhi, Rambha Manohar Madhusudhan
ACS Omega, 2025
Corrigendum to “Several distance and degree-based molecular structural attributes of cove-edged graphene nanoribbons” [Heliyon Volume 10, Issue 15, August 2024, Article e34944] (Heliyon (2024) 10(15), (S2405844024109759), (10.1016/j.heliyon.2024.e34944))
S. Prabhu, G. Murugan, Muhammad Imran, Micheal Arockiaraj, Mohammad Mahtab Alam, Muhammad Usman Ghani
Heliyon, 2025
Distance and degree based topological characterization, spectral and energetic properties, and 13C NMR signals of holey nanographene
Savari Prabhu, M. Arulperumjothi, Fikadu Tesgera Tolasa, S. Govardhan
Electrochemistry Communications, 2025
An efficient way to represent the processors and their connections in omega networks
Savari Prabhu, T. Jenifer Janany, Paul Manuel
Ain Shams Engineering Journal, 2025
Computational analysis of linear chain of holey nanographene and their molecular characterizations
S. Prabhu, M. Arulperumjothi, S. Salu, Bibin K. Jose
Journal of Molecular Modeling, 2025
On the central resolver set of the edge coronation graphs
Liliek Susilowati, Utik Maulida, Nenik Estuningsih, Siti Zahidah, Savari Prabhu
Journal of Discrete Mathematical Sciences and Cryptography, 2025
The star-chromatic number of snarks and its variants
C. Renuga, D. Meiyappan, S. Prabhu
Journal of Intelligent and Fuzzy Systems, 2025
Bandwidth of WK-recursive networks and its sparse matrix computation
R. Nathiya, D. Meiyappan, Savari Prabhu, Sudeep Stephen
Journal of Supercomputing, 2025
MOLECULAR TOPOLOGICAL CHARACTERIZATION OF TESSELLATIONS OF RECTANGULAR KEKULENE STRUCTURES
Palestine Journal of Mathematics, 2025
ON VARIOUS DISTANCE-BASED TOPOLOGICAL INDICES OF HEXABENZOCORONENE WITH BITRAPEZIUM STRUCTURE
Palestine Journal of Mathematics, 2025
Ambient-Stable Electroactive Graphene Nanoribbons: A Comprehensive Analysis of Distance, Degree, Energetics and13 C NMR Signals
Savari Prabhu, Simili Abraham, Bibin K. Jose, M. Arulperumjothid, Tony Augustine
Combinatorial Chemistry and High Throughput Screening, 2025
Certain Domination Parameters and Their Resolving Versions of Fractal Cubic Networks
Savari Prabhu, Arumugam Krishnan Arulmozhi, M. Arulperumjothi
Fractal and Fractional, 2024
Distance based topological characterization, graph energy prediction, and NMR patterns of benzene ring embedded in P-type surface in 2D network
Xiujun Zhang, S. Prabhu, M. Arulperumjothi, S. Manikanda Prabhu, Micheal Arockiaraj, V. Manimozhi
Scientific Reports, 2024
Several distance and degree-based molecular structural attributes of cove-edged graphene nanoribbons
S. Prabhu, G. Murugan, Muhammad Imran, Micheal Arockiaraj, Mohammad Mahtab Alam, Muhammad Usman Ghani
Heliyon, 2024
Fault-tolerant basis of generalized fat trees and perfect binary tree derived architectures
S. Prabhu, V. Manimozhi, Akbar Davoodi, Juan Luis García Guirao
Journal of Supercomputing, 2024
Topological characterization of cove-edged graphene nanoribbons with applications to NMR spectroscopies
S. Govardhan, S. Roy, S. Prabhu, M. Arulperumjothi
Journal of Molecular Structure, 2024
Topological characterizations on hexagonal and rectangular tessellations of antikekulenes and its computed spectral, nuclear magnetic resonance and electron spin resonance characterizations
S. Prabhu, M. Arulperumjothi, V. Manimozhi, Krishnan Balasubramanian
International Journal of Quantum Chemistry, 2024
Certain domination numbers for Cartesian product of graphs
S. Arulanand, R. Sundara Rajan, S. Prabhu, Sudeep Stephen
Journal of Discrete Mathematical Sciences and Cryptography, 2024
The Local Resolving Dominating Set of Comb Product Graphs
Iaeng International Journal of Computer Science, 2024
Metric Dimension of Irregular Convex Triangular Networks
S. Prabhu, D. Sagaya Rani Jeba, M. Arulperumjothi, Sandi Klavžar
Akce International Journal of Graphs and Combinatorics, 2024
Local Multiset Dimension of Amalgamation Graphs
Ridho Alfarisi, Liliek Susilowati, Dafik Dafik, Savari Prabhu
F1000research, 2024
On Detour Index of Join of Hamilton-connected Graphs
and S. Prabhu
Ars Combinatoria, 2024
On Counting Polynomials of Supercoronenes and Triangle-Shaped Discotic Graphene
S. Prabhu, M. Arulperumjothi, Juan Luis García Guirao, R. Muthucumaraswamy, V. Gayathri, M. R. Farahani
Polycyclic Aromatic Compounds, 2024
2-power domination number for Knödel graphs and its application in communication networks
R. Sundara Rajan, S. Arulanand, S. Prabhu, Indra Rajasingh
RAIRO Operations Research, 2023
Redefining fractal cubic networks and determining their metric dimension and fault-tolerant metric dimension
M. Arulperumjothi, Sandi Klavžar, S. Prabhu
Applied Mathematics and Computation, 2023
Computational Analysis of Some More Rectangular Tessellations of Kekulenes and Their Molecular Characterizations
S. Prabhu, M. Arulperumjothi, Muhammad Usman Ghani, Muhammad Imran, S. Salu, Bibin K. Jose
Molecules, 2023
On generalized reduced first and second Zagreb indices of semi and total transformation of graphs
Prabhu Savari, Sagaya Rani Jeba Dason, Manimozhi Venkatapathy
Aip Conference Proceedings, 2023
Topological indices and entropies of triangular and rhomboidal tessellations of kekulenes with applications to NMR and ESR spectroscopies
S. Govardhan, S. Roy, Krishnan Balasubramanian, S. Prabhu
Journal of Mathematical Chemistry, 2023
Local Metric Dimension of Certain Classes of Circulant Networks
V. Jude Annie Cynthia, M. Ramya, S. Prabhu
Journal of Advanced Computational Intelligence and Intelligent Informatics, 2023
2-domination number for special classes of hypercubes, enhanced hypercubes and Knodel graphs
S. Arulanand, R. Sundara Rajan, S. Prabhu
International Journal of Networking and Virtual Organisations, 2023
Computation of Neighborhood M-Polynomial of Three Classes of Polycyclic Aromatic Hydrocarbons
S. Govardhan, S. Roy, S. Prabhu, Muhammad Kamran Siddiqui
Polycyclic Aromatic Compounds, 2023
Molecular Structural Characterization of Supercorenene and Triangle-Shaped Discotic Graphene
B. Saravanan, Savari Prabhu, M. Arulperumjothi, K. Julietraja, Muhammad Kamran Siddiqui
Polycyclic Aromatic Compounds, 2023
On counting polynomials of certain classes of polycyclic aromatic hydrocarbons
M. Arulperumjothi, S. Prabhu, Jia-Bao Liu, P. Yakkana Rajasankar, V. Gayathri
Polycyclic Aromatic Compounds, 2023
Optimal PMU placement problem in octahedral networks
Savari Prabhu, S. Deepa, Rajvikram Madurai Elavarasan, Eklas Hossain
RAIRO Operations Research, 2022
RETRACTION:Resolving-power domination number of probabilistic neural networks
S. Prabhu, S. Deepa, M. Arulperumjothi, Liliek Susilowati, Jia-Bao Liu
Journal of Intelligent and Fuzzy Systems, 2022
On the Dominant Local Metric Dimension of Corona Product Graphs
Iaeng International Journal of Applied Mathematics, 2022
Twin vertices in fault-tolerant metric sets and fault-tolerant metric dimension of multistage interconnection networks
S. Prabhu, V. Manimozhi, M. Arulperumjothi, Sandi Klavžar
Applied Mathematics and Computation, 2022
On Certain Topological Indices of Three-Layered Single-Walled Titania Nanosheets
Micheal Arockiaraj, Jia-Bao Liu, M. Arulperumjothi, S. Prabhu
Combinatorial Chemistry and High Throughput Screening, 2022
Molecular structural characterization of superphenalene and supertriphenylene
M. Radhakrishnan, Savari Prabhu, Micheal Arockiaraj, M. Arulperumjothi
International Journal of Quantum Chemistry, 2022
On 2-domination number in certain octahedral networks
Sundara Rajan R, Arulanand S, Prabhu S
International Journal of Networking and Virtual Organisations, 2022
M-Polynomial and Degree-Based Molecular Descriptors of Certain Classes of Benzenoid Systems
K. Julietraja, P. Venugopal, S. Prabhu, Jia-Bao Liu
Polycyclic Aromatic Compounds, 2022
Molecular Structural Descriptors of Donut Benzenoid Systems
Julietraja K., Venugopal P., Prabhu S., Deepa S., Muhammad Kamran Siddiqui
Polycyclic Aromatic Compounds, 2022
Structural Analysis of Three Types of PAHs using Entropy Measures
Konsalraj Julietraja, Padmanabhan Venugopal, Savari Prabhu, Arumugam Krishnan Arulmozhi, Muhammad Kamran Siddiqui
Polycyclic Aromatic Compounds, 2022
Molecular Structural Characterization of Cycloparaphenylene and its Variants
S. Prabhu, G. Murugan, S. Kulandai Therese, M. Arulperumjothi, Muhammad Kamran Siddiqui
Polycyclic Aromatic Compounds, 2022
Independent domination in directed graphs
Michael Cary, Jonathan Cary, S. Prabhu
Communications in Combinatorics and Optimization, 2021
On detour index of cycloparaphenylene and polyphenylene molecular structures
S. Prabhu, Y. Sherlin Nisha, M. Arulperumjothi, D. Sagaya Rani Jeba, V. Manimozhi
Scientific Reports, 2021
Omega, Theta, PI, Sadhana polynomials, and subsequent indices of convex benzenoid system
V. Gayathri, R. Muthucumaraswamy, Savari Prabhu, M.R. Farahani
Computational and Theoretical Chemistry, 2021
Correction to: Topological characterization of hexagonal and rectangular tessellations of kekulenes as traps for toxic heavy metal ions (Theoretical Chemistry Accounts, (2021), 140, 4, (43), 10.1007/s00214-021-02733-0)
Micheal Arockiaraj, S. Prabhu, M. Arulperumjothi, S. Ruth Julie Kavitha, Krishnan Balasubramanian
Theoretical Chemistry Accounts, 2021
Distance based and bond additive topological indices of certain repurposed antiviral drug compounds tested for treating COVID-19
Jia‐Bao Liu, Micheal Arockiaraj, M. Arulperumjothi, Savari Prabhu
International Journal of Quantum Chemistry, 2021
Molecular topological characterization of three classes of polycyclic aromatic hydrocarbons
S. Prabhu, G. Murugan, Micheal Arockiaraj, M. Arulperumjothi, V. Manimozhi
Journal of Molecular Structure, 2021
Topological characterization of hexagonal and rectangular tessellations of kekulenes as traps for toxic heavy metal ions
Micheal Arockiaraj, S. Prabhu, M. Arulperumjothi, S. Ruth Julie Kavitha, Krishnan Balasubramanian
Theoretical Chemistry Accounts, 2021
On Detour Index of Join of Graphs
S. Prabhu, Y. Sherlin Nisha
Lecture Notes in Electrical Engineering, 2021
On the edge-version of topological indices of titanium dioxide nanotube and nanosheet
S. Prabhu, G. Murugan, M. Arulperumjothi
Nanoscience and Nanotechnology Asia, 2021
On Total Domination Number of Hypercube and Enhanced Hypercube Networks
S. Prabhu, S. Deepa, G. Murugan, M. Arulperumjothi
Lecture Notes on Data Engineering and Communications Technologies, 2021
On certain topological indices of gold crystal
S. Prabhu, N. Saikumari, G. Murugan, K.S. Sudhakhar
Materials Today Proceedings, 2021
Degree- and irregularity-based molecular descriptors for benzenoid systems
Yu-Ming Chu, K. Julietraja, P. Venugopal, Muhammad Kamran Siddiqui, Savari Prabhu
European Physical Journal Plus, 2021
On the Sanskruti Index of Certain Silicate and Its Derived Structures
S. Prabhu, G. Murugan, Jia-Bao Liu, M. Arulperumjothi, Sunilkumar Hosamani
Lecture Notes in Electrical Engineering, 2021
Second Zagreb and Sigma Indices of Semi and Total Transformations of Graphs
Zhen Yang, Micheal Arockiaraj, Savari Prabhu, M. Arulperumjothi, Jia-Bao Liu
Complexity, 2021
Wiener Polarity Index Calculation of Square-Free Graphs and Its Implementation to Certain Complex Materials
Lin Zhang, Tian-Le Sun, Micheal Arockiaraj, M. Arulperumjothi, S. Prabhu
Mathematical Problems in Engineering, 2021
On the Zagreb and Wiener polarity indices of C3-free chemical nanostructures
Utilitas Mathematica, 2020
Star domination and star irredundance in graphs
Utilitas Mathematica, 2020
On certain distance and degree based topological indices of Zeolite LTA frameworks
S Prabhu, G Murugan, Michael Cary, M Arulperumjothi, Jia-Bao Liu
Materials Research Express, 2020
On certain counting polynomial of titanium dioxide nanotubes
S. Prabhu, M. Arulperumjothi, G. Murugan, V.M. Dhinesh, J.P. Kumar
Nanoscience and Nanotechnology Asia, 2019
On certain topological indices of titanium dioxide nanosheet and nanotube
S. Prabhu, M. Arulperumjothi, G. Murugan
Nanoscience and Nanotechnology Asia, 2018
On independent resolving number of TiO 2 [ m, n ] nanotubes
S. Prabhu, T. Flora, M. Arulperumjothi
Journal of Intelligent and Fuzzy Systems, 2018
On certain resolving parameters of tree derived architectures
Journal of Combinatorial Mathematics and Combinatorial Computing, 2015

Savari Prabhu

EDUCATION

RESEARCH, TEACHING, or OTHER INTERESTS

Scopus Publications

RECENT SCHOLAR PUBLICATIONS

MOST CITED SCHOLAR PUBLICATIONS