P. K. Niranjan

According to our database, P. K. Niranjan authored at least 5 papers between 2018 and 2025.

Collaborative distances:

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

2025

L(2,1)-coloring and its related problems for Mycielskians of certain classes of graphs.

Srinivasa Rao Kola, Balakrishna Gudla, P. K. Niranjan

Discret. Math. Algorithms Appl., November, 2025

2020

On the radio number for corona of paths and cycles.

P. K. Niranjan, Srinivasa Rao Kola

AKCE Int. J. Graphs Comb., 2020

Some classes of trees with maximum number of holes two.

Srinivasa Rao Kola, Balakrishna Gudla, P. K. Niranjan

AKCE Int. J. Graphs Comb., 2020

2019

The k-distance chromatic number of trees and cycles.

P. K. Niranjan, Srinivasa Rao Kola

AKCE Int. J. Graphs Comb., 2019

2018

Infinitely Many Trees with Maximum Number of Holes Zero, One, and Two.

Srinivasa Rao Kola, Balakrishna Gudla, P. K. Niranjan

J. Appl. Math., 2018