Hanumappa B. Walikar

According to our database, Hanumappa B. Walikar authored at least 11 papers between 2002 and 2013.

Collaborative distances:

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

2013

Few More Results in domatically Co-Critical Graphs.

Hanumappa B. Walikar, L. Sudershan Reddy, S. B. Basapur

Discret. Math. Algorithms Appl., 2013

2011

Graphs that are not domatically Co-Critical.

Hanumappa B. Walikar, L. Sudershan Reddy

Discret. Math. Algorithms Appl., 2011

2010

Designs associated with maximum independent sets of a graph.

Hanumappa B. Walikar, B. Devadas Acharya, Shailaja S. Shirkol

Des. Codes Cryptogr., 2010

2005

Spectra and energies of iterated line graphs of regular graphs.

Harishchandra S. Ramane, Hanumappa B. Walikar, Siddani Bhaskara Rao, B. Devadas Acharya, Prabhakar Ramrao Hampiholi, Sudhir R. Jog, Ivan Gutman

Appl. Math. Lett., 2005

2003

On the Eigenvalues of a Graph.

Hanumappa B. Walikar, Harishchandra S. Ramane

Electron. Notes Discret. Math., 2003

On the Resistance Distance of a Tree.

Hanumappa B. Walikar, D. N. Misale, R. L. Patil, Harishchandra S. Ramane

Electron. Notes Discret. Math., 2003

Some Minimal Graphs by Interlacing Eigenvalues.

Hanumappa B. Walikar, P. R. Hamipholi, Harishchandra S. Ramane

Electron. Notes Discret. Math., 2003

Partial Complement of a Graph.

Hanumappa B. Walikar

Electron. Notes Discret. Math., 2003

DDR Graphs of Diameter Three.

Medha Huilgol, Hanumappa B. Walikar, B. Devadas Acharya

Electron. Notes Discret. Math., 2003

Radius-edge-invariant and diameter-edge-invariant graphs.

Hanumappa B. Walikar, Fred Buckley, M. K. Itagi

Discret. Math., 2003

2002

Diameter-essential edges in a graph.

Hanumappa B. Walikar, Fred Buckley, M. K. Itagi

Discret. Math., 2002