S. Ganesamurthy

According to our database, S. Ganesamurthy authored at least 9 papers between 2018 and 2024.

Collaborative distances:

• Dijkstra number of six.
• Erdős number of four.

2024

Hamilton cycles in generalized Mycielski graphs.

L. Panneerselvam, S. Ganesamurthy, Appu Muthusamy

Discret. Math. Algorithms Appl., October, 2024

2023

Decompositions of line graphs of complete graphs into paths and cycles.

S. Ganesamurthy

Discret. Math., 2023

2021

Decompositions of Some Classes of Dense Graphs into Cycles of Lengths 4 and 8.

S. Ganesamurthy, P. Paulraja

Graphs Comb., 2021

Decompositions of some classes of regular graphs and digraphs into cycles of length 4p.

S. Ganesamurthy, R. S. Manikandan, P. Paulraja

Australas. J Comb., 2021

2019

Multidecompositions of line graphs of complete graphs.

S. Ganesamurthy, P. Paulraja, R. Srimathi

Discret. Math. Algorithms Appl., 2019

A C5-decomposition of the λ-fold line graph of the complete graph.

S. Ganesamurthy, P. Paulraja

Discret. Math., 2019

Decompositions of complete tripartite graphs into cycles of lengths 3 and 6.

S. Ganesamurthy, P. Paulraja

Australas. J Comb., 2019

2018

2p-cycle decompositions of some regular graphs and digraphs.

S. Ganesamurthy, P. Paulraja

Discret. Math., 2018

Existence of a P2k+1-decomposition in the Kneser graph KGt, 2.

S. Ganesamurthy, P. Paulraja

Discret. Math., 2018