N. Sridharan

According to our database, N. Sridharan authored at least 9 papers between 1999 and 2013.

Collaborative distances:

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

2013

Induced subgraphs of Gamma graphs.

N. Sridharan, S. Amutha, S. B. Rao

Discret. Math. Algorithms Appl., 2013

2010

A sharp lower bound for the Wiener index of a graph

R. Balakrishnan, N. Sridharan, K. Viswanathan Iyer

CoRR, 2010

2008

Wiener index of graphs with more than one cut-vertex.

R. Balakrishnan, N. Sridharan, K. Viswanathan Iyer

Appl. Math. Lett., 2008

2006

A Note On Excellent Graphs.

N. Sridharan, M. Yamuna

Ars Comb., 2006

2003

A Study on Hamiltonian Matroids.

N. Sridharan, R. Lalithambal

Electron. Notes Discret. Math., 2003

Characterization of Graphs G for which <i>I</i>.

N. Sridharan, M. D. Elias, V. S. A. Subramanian

Electron. Notes Discret. Math., 2003

Discrete Fuzzy Matroids.

N. Chandrasekaran, N. Sridharan

Electron. Notes Discret. Math., 2003

2002

Bounds on the Distance Two-Domination Number of a Graph.

N. Sridharan, V. S. A. Subramanian, M. D. Elias

Graphs Comb., 2002

1999

Simple graphs containing induced subgraphs whose automorphism groups are isomorphic to subgroups of a given finite group.

N. Sridharan, G. Ramachandran

Discret. Math., 1999