The following pages link to Ashwin Ganesan (Q339494):
Displaying 16 items.
- Edge-transitivity of Cayley graphs generated by transpositions (Q339495) (← links)
- Automorphism groups of Cayley graphs generated by connected transposition sets (Q389469) (← links)
- Automorphism group of the complete transposition graph (Q887942) (← links)
- The performance of an upper bound on the fractional chromatic number of weighted graphs (Q968556) (← links)
- Fault tolerant supergraphs with automorphisms (Q1720338) (← links)
- An extreme point result for convexity, concavity and monotonicity of parameterized linear equation solutions (Q1886525) (← links)
- On universally decodable matrices for space-time coding (Q2383973) (← links)
- Performance analysis of distance-1 distributed algorithms for admission control under the 2-hop interference model (Q2682938) (← links)
- On the automorphism group of Cayley graphs generated by transpositions (Q2800795) (← links)
- On the sharpness of a bound on the diameter of Cayley graphs generated by transposition trees (Q2850064) (← links)
- On the Existence of Universally Decodable Matrices (Q3548925) (← links)
- On the automorphism group of a Johnson graph (Q4568217) (← links)
- The regular number of a graph (Q4648998) (← links)
- On Some Distributed Scheduling Algorithms for Wireless Networks With Hypergraph Interference Models (Q5001592) (← links)
- On the Strictness of a Bound for the Diameter of Cayley Graphs Generated by Transposition Trees (Q5867207) (← links)
- Performance analysis of a distributed algorithm for admission control in wireless networks under the $2$-hop interference model (Q6345181) (← links)
