Pratima Panigrahi

According to our database1, Pratima Panigrahi authored at least 30 papers between 1998 and 2020.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

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

Self-centeredness of Generalized Petersen Graphs.
Proceedings of the Algorithms and Discrete Applied Mathematics, 2020

2019
A new graph radio k-coloring algorithm.
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
On irreducible no-hole L(2, 1)-coloring of subdivision of graphs.
J. Comb. Optim., 2017

On self-centeredness of tensor product of some graphs.
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
Solutions of some <i>L(2, 1)</i>-coloring related open problems.
Discuss. Math. Graph Theory, 2016

On Irreducible No-hole L(2, 1)-labelings of Hypercubes and Triangular Lattices.
Proceedings of the Algorithms and Discrete Applied Mathematics, 2016

Distance Spectral Radius of Some k-partitioned Transmission Regular Graphs.
Proceedings of the Algorithms and Discrete Applied Mathematics, 2016

2015
On the Radio Number of Square of Graphs.
Electron. Notes Discret. Math., 2015

Radio Numbers of Some Caterpillars.
Electron. Notes Discret. Math., 2015

A lower bound for radio k-chromatic number.
Discret. Appl. Math., 2015

A Lower Bound for Radio $k$-chromatic Number of an Arbitrary Graph.
Contributions Discret. Math., 2015

2013
On the radio number of toroidal grids.
Australas. J Comb., 2013

2012
Antipodal number of some powers of cycles.
Discret. Math., 2012

A Graph Radio <i>k</i>-Coloring Algorithm.
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
Improved Bounds for Radio k-Chromatic Number of Hypercube Qn.
Int. J. Math. Math. Sci., 2011

All primitive strongly regular graphs except four are hyperenergetic.
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
Graceful Labeling of Balanced Stars of Paths.
Electron. Notes Discret. Math., 2003

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

1998
The Collinearity Graph of the O<sup>-(8, 2)</sup> Quadric Is Not Geometrisable.
Des. Codes Cryptogr., 1998


  Loading...