We stand with Ukraine  

S. Ganesamurthy

Orcid: 0000-0003-0469-8349

Affiliations:
  • Periyar University, Department of Mathematics, India


According to our database1, S. Ganesamurthy authored at least 10 papers between 2018 and 2025.

Collaborative distances:
  • Dijkstra number2 of six.
  • Erdős number3 of four.

Timeline

Legend:

Book  In proceedings  Article  PhD thesis  Dataset  Other 

Links

Online presence:

On csauthors.net:

Bibliography

2025
Connected power domination number of product graphs.
[BibTeX]
[DOI]
S. Ganesamurthy
,
R. Srimathi
,
J. Jeyaranjani
Discret. Math. Algorithms Appl., October, 2025

2024
Hamilton cycles in generalized Mycielski graphs.
[BibTeX]
[DOI]
L. Panneerselvam
,
S. Ganesamurthy
,
Appu Muthusamy
Discret. Math. Algorithms Appl., October, 2024

2023
Decompositions of line graphs of complete graphs into paths and cycles.
[BibTeX]
[DOI]
S. Ganesamurthy
Discret. Math., 2023

2021
Decompositions of Some Classes of Dense Graphs into Cycles of Lengths 4 and 8.
[BibTeX]
[DOI]
S. Ganesamurthy
,
P. Paulraja
Graphs Comb., 2021

Decompositions of some classes of regular graphs and digraphs into cycles of length 4p.
[BibTeX]
[DOI]
S. Ganesamurthy
,
R. S. Manikandan
,
P. Paulraja
Australas. J Comb., 2021

2019
Multidecompositions of line graphs of complete graphs.
[BibTeX]
[DOI]
S. Ganesamurthy
,
P. Paulraja
,
R. Srimathi
Discret. Math. Algorithms Appl., 2019

A C5-decomposition of the λ-fold line graph of the complete graph.
[BibTeX]
[DOI]
S. Ganesamurthy
,
P. Paulraja
Discret. Math., 2019

Decompositions of complete tripartite graphs into cycles of lengths 3 and 6.
[BibTeX]
[DOI]
S. Ganesamurthy
,
P. Paulraja
Australas. J Comb., 2019

2018
2p-cycle decompositions of some regular graphs and digraphs.
[BibTeX]
[DOI]
S. Ganesamurthy
,
P. Paulraja
Discret. Math., 2018

Existence of a P2k+1-decomposition in the Kneser graph KGt, 2.
[BibTeX]
[DOI]
S. Ganesamurthy
,
P. Paulraja
Discret. Math., 2018


  Loading...