# Pratima Panigrahi

According to our database

Collaborative distances:

^{1}, Pratima Panigrahi authored at least 30 papers between 1998 and 2020.Collaborative distances:

## Timeline

#### Legend:

Book In proceedings Article PhD thesis Other## Links

#### On csauthors.net:

## Bibliography

2020

L(2, 1)-colorings and irreducible no-hole colorings of the direct product of graphs.

Discret. Appl. Math., 2020

Proceedings of the Algorithms and Discrete Applied Mathematics, 2020

2019

Discret. Math. Algorithms Appl., 2019

2018

Bounds on Maximal and Minimal Entries of the p-Normalized Principal Eigenvector of the Distance and Distance Signless Laplacian Matrices of Graphs.

Graphs Comb., 2018

Irreducible no-hole <i>L</i>(2, 1)-coloring of edge-multiplicity-paths-replacement graph.

Discuss. Math. Graph Theory, 2018

Normalized Laplacian spectrum of some subdivision-joins and R-joins of two regular graphs.

AKCE Int. J. Graphs Comb., 2018

2017

J. Comb. Optim., 2017

Electron. Notes Discret. Math., 2017

<i>L</i>(2, 1)-colorings and Irreducible No-hole Colorings of Cartesian Product of Graphs.

Electron. Notes Discret. Math., 2017

On Sum of Powers of the Laplacian Eigenvalues of Power Graphs of Certain Finite Groups.

Electron. Notes Discret. Math., 2017

2016

Discuss. Math. Graph Theory, 2016

Proceedings of the Algorithms and Discrete Applied Mathematics, 2016

Proceedings of the Algorithms and Discrete Applied Mathematics, 2016

2015

Electron. Notes Discret. Math., 2015

Electron. Notes Discret. Math., 2015

Discret. Appl. Math., 2015

Contributions Discret. Math., 2015

2013

Australas. J Comb., 2013

2012

Discret. Math., 2012

Proceedings of the Combinatorial Algorithms, 23rd International Workshop, 2012

Improved Lower Bound for Radio Number of an Arbitrary Graph.

Proceedings of the 11th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, 2012

2011

Int. J. Math. Math. Sci., 2011

Appl. Math. Lett., 2011

2010

An improved lower bound for the radio k-chromatic number of the hypercube Q<sub>n</sub>.

Comput. Math. Appl., 2010

2008

Some graceful lobsters with all three types of branches incident on the vertices of the central path.

Comput. Math. Appl., 2008

Graceful Lobsters Obtained from Diameter Four Trees Using Partitioning Technique.

Ars Comb., 2008

2006

Graceful Lobsters Obtained by Component Moving of Diameter Four Trees.

Ars Comb., 2006

2003

Electron. Notes Discret. Math., 2003

2000

The Non-Collinearity Graph of the (8, 2) Quadric Is Uniquely Geometrisable.

Des. Codes Cryptogr., 2000

1998

Des. Codes Cryptogr., 1998