#### Filter Results:

- Full text PDF available (4)

#### Publication Year

2003

2015

- This year (0)
- Last 5 years (2)
- Last 10 years (3)

#### Publication Type

#### Co-author

#### Publication Venue

#### Key Phrases

Learn More

- Hanumappa B. Walikar, Harishchandra S. Ramane
- Electronic Notes in Discrete Mathematics
- 2003

- Harishchandra S. Ramane, Hanumappa B. Walikar, +4 authors Ivan Gutman
- Appl. Math. Lett.
- 2005

- Hanumappa B. Walikar, Harishchandra S. Ramane, Leela Sindagi, Shailaja S. Shirakol, Ivan Gutman
- 2006

The Hosoya polynomial is determined for thorn trees, thorn rods, rings, and stars, which are special cases of thorn graphs. By this some earlier results by Bonchev and Klein are generalized. Various distance–based topological indices, namely Wiener index, hyper–Wiener index, Harary index, and reciprocal Wiener index can thus be computed for the classes of… (More)

- H. S. Ramane, D. S. Revankar, I. Gutman, H. B. Walikar, Slobodan Simić
- 2009

The distance or D-eigenvalues of a graph G are the eigenvalues of its distance matrix. The distance or D-energy E D (G) of the graph G is the sum of the absolute values of its D-eigenvalues. Two graphs G 1 and G 2 are said to be D-equienergetic if E D (G 1) = E D (G 2). Let F 1 be the 5-vertex path, F 2 the graph obtained by identifying one vertex of a… (More)

- Hanumappa B. Walikar, P. R. Hamipholi, Harishchandra S. Ramane
- Electronic Notes in Discrete Mathematics
- 2003

- Veena Mathad, Sultan Senan Mahde, +17 authors H. B. Walikar
- 2015

In this paper, the concept of minimum hub distance energy EHd(G) of a connected graph G is introduced and minimum hub distance energies of some standard graphs and a number of wellknown families of graphs are computed. Upper and lower bounds for EHd(G) are also established.

- Hanumappa B. Walikar, D. N. Misale, R. L. Patil, Harishchandra S. Ramane
- Electronic Notes in Discrete Mathematics
- 2003

- Harishchandra S. Ramane, Ashwini S. Yalnaik
- EJGTA
- 2015

- EQUIENERGETIC GRAPHS, Harishchandra S. Ramane, +5 authors Ivan Gutman
- 2003

The energy of a graph is the sum of the absolute values of its eigenvalues. Two graphs are said to be equienergetic if their energies are equal. We show how infinitely many pairs of equienergetic graphs can be constructed, such that these graphs are connected, possess equal number of vertices, equal number of edges, and are not cospectral.

- ‹
- 1
- ›