Siddani Bhaskara Rao

According to our database, Siddani Bhaskara Rao authored at least 10 papers between 1979 and 2021.

Collaborative distances:

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

2021

On Degree Sequences and Eccentricities in Pseudoline Arrangement Graphs.

Sandip Das, Siddani Bhaskara Rao, Uma Kant Sahoo

Proceedings of the Algorithms and Discrete Applied Mathematics, 2021

2020

Cycle stochastic graphs: Structural and forbidden graph characterizations.

Siddani Bhaskara Rao, Uma Kant Sahoo, V. Parameswaran

AKCE Int. J. Graphs Comb., 2020

2015

Embeddings in Eulerian graceful graphs.

Siddani Bhaskara Rao, Uma Kant Sahoo

Australas. J Comb., 2015

2010

Hypergraceful complete graphs.

Siddani Bhaskara Rao, B. Devadas Acharya, Tarkeshwar Singh, Mukti Acharya

Australas. J Comb., 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

Studying Properties of Graphs through their k-vertex Subsets: I IIkappa-complete Graphs and IIkappa-completion numbers.

E. Sampathkumar, B. Devadas Acharya, Siddani Bhaskara Rao, Sheshayya A. Choudum

Electron. Notes Discret. Math., 2003

Minimum Monopoly in Regular and Tree Graphs.

Sounaka Mishra, Siddani Bhaskara Rao

Electron. Notes Discret. Math., 2003

Characterization of Cycle Stochastic Graphs.

K. Balasubramanian, V. Parameswaran, Siddani Bhaskara Rao

Electron. Notes Discret. Math., 2003

1979

Solution of the Hamiltonian problem for self-complementary graphs.

Siddani Bhaskara Rao

J. Comb. Theory, Ser. B, 1979

The number of open chains of length three and the parity of the number of open chains of length k in self-complementary graphs.

Siddani Bhaskara Rao

Discret. Math., 1979