Ashwin Ganesan

activity

20052026

most citedAutomorphism group of the complete transposition graph

34 citations · 135 across the 24 of their papers we have counts for

collaborators

Showing 2011 · cs.DMShow all

3 papers · 2 filters

cs.DM2011★ 2 cited

Diameter of Cayley graphs of permutation groups generated by transposition trees

Ashwin Ganesan

Let $Γ$ be a Cayley graph of the permutation group generated by a transposition tree $T$ on $n$ vertices. In an oft-cited paper \cite{Akers:Krishnamurthy:1989} (see also \cite{Hahn…

cs.DM2011

The regular number of a graph

Ashwin Ganesan, Radha R. Iyer

Let $G$ be a simple undirected graph. The regular number of $G$ is defined to be the minimum number of subsets into which the edge set of $G$ can be partitioned so that the subgrap…

cs.DM2011★ 3 cited

Minimal resolving sets for the hypercube

Ashwin Ganesan

For a given undirected graph $G$ , an \emph{ordered} subset $S = s_{1}, s_{2}, ..., s_{k} \subseteq V$ of vertices is a resolving set for the graph if the vertices of the graph are disting…