default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDK. Somasundaram 0001
Person information
- affiliation: Amrita School of Engineering, Department of Mathematics, India
Other persons with the same name
- K. Somasundaram — disambiguation page
- K. Somasundaram 0002 — Arupadai Veedu Institute of Technology, Jaya Engineering College, Chennai, India (and 1 more)
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j30]R. Navaneeth, Jayabalan Geetha, Kanagasabapathi Somasundaram, Hung-Lin Fu:
Total colorings of some classes of four regular circulant graphs. AKCE Int. J. Graphs Comb. 21(1): 1-3 (2024)- [j29]T. P. Sandhiya
, J. Geetha, K. Somasundaram:
Total chromatic number for certain classes of product graphs. Discret. Math. Algorithms Appl. 16(7): 2350099:1-2350099:8 (2024) - [j28]Lakshmi Girish, Kanagasabapathi Somasundaram:
Bound for the k-Fault-Tolerant Power-Domination Number. Symmetry 16(7): 781 (2024) - 2023
- [j27]Jayabalan Geetha, Narayanan Narayanan, Kanagasabapathi Somasundaram:
Total colorings-a survey. AKCE Int. J. Graphs Comb. 20(3): 339-351 (2023) - [j26]Kanagasabapathi Somasundaram, Jayabalan Geetha, Radhakrishnan Vignesh:
Total coloring conjecture on certain classes of product graphs. Electron. J. Graph Theory Appl. 11(1): 223-234 (2023) - [j25]S. C. Manju, J. Geetha, K. Somasundaram:
PI and weighted PI indices for powers of paths, cycles, and their complements. J. Intell. Fuzzy Syst. 44(1): 1439-1452 (2023) - [j24]S. Prajnanaswaroopa, J. Geetha, K. Somasundaram:
Total chromatic number for some classes of Cayley graphs. Soft Comput. 27(21): 15609-15617 (2023) - 2022
- [j23]Divya K. Udayan, Kanagasabapathi Somasundaram:
Some Results on Majorization of Matrices. Axioms 11(4): 146 (2022) - [j22]Divya K. Udayan, K. Somasundaram:
Permanent dominance conjecture for derived partitions. Bull. ICA 95: 84-92 (2022) - [j21]T. P. Sandhiya, J. Geetha, K. Somasundaram:
Total colorings of certain classes of lexicographic product graphs. Discret. Math. Algorithms Appl. 14(3): 2150129:1-2150129:7 (2022) - [j20]Shantharam Prajnanaswaroopa, Jayabalan Geetha, Kanagasabapathi Somasundaram, Teerapong Suksumran:
Total Coloring of Some Classes of Cayley Graphs on Non-Abelian Groups. Symmetry 14(10): 2173 (2022) - 2021
- [j19]C. Gopika, J. Geetha, K. Somasundaram:
Weighted PI index of tensor product and strong product of graphs. Discret. Math. Algorithms Appl. 13(3): 2150019:1-2150019:21 (2021) - [j18]J. Geetha, K. Somasundaram, Hung-Lin Fu:
Total colorings of circulant graphs. Discret. Math. Algorithms Appl. 13(5): 2150050:1-2150050:10 (2021) - [j17]S. Mohan, J. Geetha, K. Somasundaram:
Total coloring of quasi-line graphs and inflated graphs. Discret. Math. Algorithms Appl. 13(5): 2150060:1-2150060:11 (2021) - [j16]Divya K. Udayan, Kanagasabapathi Somasundaram:
The Inequalities of Merris and Foregger for Permanents. Symmetry 13(10): 1782 (2021) - [i3]Prajnanaswaroopa S, J. Geetha, K. Somasundaram:
Total, Equitable Total and Neighborhood sum distinguishing Total Colorings of Some Classes of Circulant Graphs. CoRR abs/2105.12490 (2021) - 2020
- [j15]Kanagasabapathi Somasundaram, M. G. Thushara:
Forward and Backward Static Analysis for Critical numerical accuracy in Floating Point Programs. Comput. Sci. 21(2) (2020) - [j14]S. Mohan, K. Somasundaram:
Total coloring of the prismatic graphs. Discret. Math. Algorithms Appl. 12(3): 2050032:1-2050032:11 (2020) - [i2]Prajnanaswaroopa S, J. Geetha, K. Somasundaram:
Total Coloring for some classes of Circulant graphs. CoRR abs/2006.07677 (2020)
2010 – 2019
- 2019
- [j13]Kanagasabapathi Somasundaram, Chythanya Calicut:
A Routing Algorithm and a Router Architecture for 3D NoC. Comput. Sci. 20(3) (2019) - [j12]Radhakrishnan Vignesh, Jayabalan Geetha, Kanagasabapathi Somasundaram:
Total coloring conjecture for vertex, edge and neighborhood corona products of graphs. Discret. Math. Algorithms Appl. 11(1): 1950014:1-1950014:9 (2019) - [c1]M. T. Indu, K. Somasundaram, C. Shunmuga Velayutham:
A Preliminary Investigation on a Graph Model of Differential Evolution Algorithm. PReMI (1) 2019: 365-374 - 2018
- [j11]Radhakrishnan Vignesh, J. Geetha, K. Somasundaram:
Total Coloring Conjecture for Certain Classes of Graphs. Algorithms 11(10): 161 (2018) - [j10]J. Geetha, K. Somasundaram:
Total Colorings of Product Graphs. Graphs Comb. 34(2): 339-347 (2018) - [j9]Nallasamy Viswanathan, Kuppusamy Paramasivam, Kanagasabapathi Somasundaram:
Vertical links minimized 3D NoC topology and router-arbiter design. Int. Arab J. Inf. Technol. 15(3): 469-478 (2018) - [i1]Jayabalan Geetha, N. Narayanan, K. Somasundaram:
Total Colourings - A survey. CoRR abs/1812.05833 (2018) - 2017
- [j8]S. Mohan, J. Geetha, K. Somasundaram:
Total coloring of corona product of two graphs. Australas. J Comb. 68: 15-22 (2017) - 2016
- [j7]S. Mohan, J. Geetha, K. Somasundaram:
Total Coloring of Certain Classes of Product Graphs. Electron. Notes Discret. Math. 53: 173-180 (2016) - [j6]J. Geetha, K. Somasundaram:
Total Chromatic Number and Some Topological Indices. Electron. Notes Discret. Math. 53: 363-371 (2016) - 2015
- [j5]J. Geetha, K. Somasundaram:
Total coloring for generalized Sierpinski graphs. Australas. J Comb. 63: 58-69 (2015) - 2014
- [j4]Kanagasabapathi Somasundaram, Juha Plosila, Nallasamy Viswanathan:
Deadlock free routing algorithm for minimizing congestion in a Hamiltonian connected recursive 3D-NoCs. Microelectron. J. 45(8): 989-1000 (2014) - [j3]Nallasamy Viswanathan, Kuppusamy Paramasivam, Kanagasabapathi Somasundaram:
An optimised 3D topology for on-chip communications. Int. J. Parallel Emergent Distributed Syst. 29(4): 346-362 (2014) - 2012
- [j2]K. Somasundaram, Juha Plosila:
Deadlock Free Routing Algorithm for Minimizing Data Packet Transmission in Network on Chip. Int. J. Embed. Real Time Commun. Syst. 3(1): 70-81 (2012)
2000 – 2009
- 2009
- [j1]K. Somasundaram:
Graph Mates. Electron. Notes Discret. Math. 33: 37-41 (2009)
Coauthor Index
aka: Jayabalan Geetha
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-23 21:26 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
