P. Nagavamsi

According to our database, P. Nagavamsi authored at least 3 papers between 1995 and 1998.

Collaborative distances:

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

1998

Weighted Irredundance of Interval Graphs.

Maw-Shang Chang, P. Nagavamsi, C. Pandu Rangan

Inf. Process. Lett., 1998

1996

Clique Transversal and Clique Independence on Comparability Graphs.

V. Balachandran, P. Nagavamsi, C. Pandu Rangan

Inf. Process. Lett., 1996

1995

Edge Domination on Bipartite Permutation Graphs and Cotriangulated Graphs.

Anand Srinivasan, K. Madhukar, P. Nagavamsi, C. Pandu Rangan, Maw-Shang Chang

Inf. Process. Lett., 1995