Graph Mates. - K. Somasundaram 001 (Electron. Notes Discret. Math., 2009)

Deadlock Free Routing Algorithm for Minimizing Data Packet Transmission in Network on Chip. - K. Somasundaram 001; Juha Plosila (Int. J. Embed. Real Time Commun. Syst., 2012)

Deadlock free routing algorithm for minimizing congestion in a Hamiltonian connected recursive 3D-NoCs. - Kanagasabapathi Somasundaram; Juha Plosila; Nallasamy Viswanathan (Microelectron. J., 2014)

An optimised 3D topology for on-chip communications. - Nallasamy Viswanathan; Kuppusamy Paramasivam; Kanagasabapathi Somasundaram (Int. J. Parallel Emergent Distributed Syst., 2014)

Total coloring for generalized Sierpinski graphs. - J. Geetha 001; K. Somasundaram 001 (Australas. J Comb., 2015)

Total Chromatic Number and Some Topological Indices. - J. Geetha 001; K. Somasundaram 001 (Electron. Notes Discret. Math., 2016)

Total Coloring of Certain Classes of Product Graphs. - S. Mohan; J. Geetha 001; K. Somasundaram 001 (Electron. Notes Discret. Math., 2016)

Total coloring of corona product of two graphs. - S. Mohan; J. Geetha 001; K. Somasundaram 001 (Australas. J Comb., 2017)

Total Coloring Conjecture for Certain Classes of Graphs. - Radhakrishnan Vignesh; J. Geetha 001; K. Somasundaram 001 (Algorithms, 2018)

Total Colourings - A survey. - Jayabalan Geetha; N. Narayanan 001; K. Somasundaram 001 (CoRR, 2018)

Total Colorings of Product Graphs. - J. Geetha 001; K. Somasundaram 001 (Graphs Comb., 2018)

Vertical links minimized 3D NoC topology and router-arbiter design. - Nallasamy Viswanathan; Kuppusamy Paramasivam; Kanagasabapathi Somasundaram (Int. Arab J. Inf. Technol., 2018)

A Preliminary Investigation on a Graph Model of Differential Evolution Algorithm. - M. T. Indu; K. Somasundaram 001; C. Shunmuga Velayutham (PReMI (1), 2019)

A Routing Algorithm and a Router Architecture for 3D NoC. - Kanagasabapathi Somasundaram; Chythanya Calicut (Comput. Sci., 2019)

Total coloring conjecture for vertex, edge and neighborhood corona products of graphs. - Radhakrishnan Vignesh; Jayabalan Geetha; Kanagasabapathi Somasundaram (Discret. Math. Algorithms Appl., 2019)

Forward and Backward Static Analysis for Critical numerical accuracy in Floating Point Programs. - Kanagasabapathi Somasundaram; M. G. Thushara (Comput. Sci., 2020)

Total Coloring for some classes of Circulant graphs. - Prajnanaswaroopa S; J. Geetha 001; K. Somasundaram 001 (CoRR, 2020)

Total coloring of the prismatic graphs. - S. Mohan; K. Somasundaram 001 (Discret. Math. Algorithms Appl., 2020)

Total, Equitable Total and Neighborhood sum distinguishing Total Colorings of Some Classes of Circulant Graphs. - Prajnanaswaroopa S; J. Geetha 001; K. Somasundaram 001 (CoRR, 2021)

Total colorings of circulant graphs. - J. Geetha 001; K. Somasundaram 001; Hung-Lin Fu (Discret. Math. Algorithms Appl., 2021)

Weighted PI index of tensor product and strong product of graphs. - C. Gopika; J. Geetha 001; K. Somasundaram 001 (Discret. Math. Algorithms Appl., 2021)

Total coloring of quasi-line graphs and inflated graphs. - S. Mohan; J. Geetha 001; K. Somasundaram 001 (Discret. Math. Algorithms Appl., 2021)

The Inequalities of Merris and Foregger for Permanents. - Divya K. Udayan; Kanagasabapathi Somasundaram (Symmetry, 2021)

Some Results on Majorization of Matrices. - Divya K. Udayan; Kanagasabapathi Somasundaram (Axioms, 2022)

Permanent dominance conjecture for derived partitions. - Divya K. Udayan; K. Somasundaram 001 (Bull. ICA, 2022)

Total colorings of certain classes of lexicographic product graphs. - T. P. Sandhiya; J. Geetha 001; K. Somasundaram 001 (Discret. Math. Algorithms Appl., 2022)

Total Coloring of Some Classes of Cayley Graphs on Non-Abelian Groups. - Shantharam Prajnanaswaroopa; Jayabalan Geetha; Kanagasabapathi Somasundaram; Teerapong Suksumran (Symmetry, 2022)

Total colorings-a survey. - Jayabalan Geetha; Narayanan Narayanan; Kanagasabapathi Somasundaram (AKCE Int. J. Graphs Comb., 2023)

Total coloring conjecture on certain classes of product graphs. - Kanagasabapathi Somasundaram; Jayabalan Geetha; Radhakrishnan Vignesh (Electron. J. Graph Theory Appl., 2023)

PI and weighted PI indices for powers of paths, cycles, and their complements. - S. C. Manju; J. Geetha 001; K. Somasundaram 001 (J. Intell. Fuzzy Syst., 2023)

Total chromatic number for some classes of Cayley graphs. - S. Prajnanaswaroopa; J. Geetha 001; K. Somasundaram 001 (Soft Comput., 2023)

Total colorings of some classes of four regular circulant graphs. - R. Navaneeth; Jayabalan Geetha; Kanagasabapathi Somasundaram; Hung-Lin Fu (AKCE Int. J. Graphs Comb., 2024)

Bound for the k-Fault-Tolerant Power-Domination Number. - Lakshmi Girish; Kanagasabapathi Somasundaram (Symmetry, 2024)

Total chromatic number for certain classes of product graphs. - T. P. Sandhiya; J. Geetha 001; K. Somasundaram 001 (Discret. Math. Algorithms Appl., 2024)

ForBac: A Static Analysis Approach With Forward and Backward Analysis for Precision in Floating-Point Computations. - M. G. Thushara; K. Somasundaram 001 (IEEE Access, 2025)

A new method for computing the vertex PI index with applications to special classes of graphs. - S. C. Manju; K. Somasundaram 001; Yilun Shang (AKCE Int. J. Graphs Comb., 2025)

Chromatic choosability for some classes of perfect graphs. - Nandana K. Vasudevan; J. Geetha 001; K. Somasundaram 001 (Discret. Math. Algorithms Appl., 2025)

Weighted PI index of edge corona product of some classes of graphs. - Rangasamy Hemalatha; J. Geetha 001; K. Somasundaram 001 (Discret. Math. Algorithms Appl., 2025)