default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDPratima Panigrahi
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j31]Aqib Khan
, Pratima Panigrahi, Swarup Kumar Panda:
Some unicyclic graphs determined by the signless Laplacian permanental polynomial. J. Appl. Math. Comput. 70(4): 2857-2878 (2024)- 2023
- [j30]Aqib Khan, Pratima Panigrahi, Swarup Kumar Panda:
A study on determination of some graphs by Laplacian and signless Laplacian permanental polynomials. AKCE Int. J. Graphs Comb. 20(1): 79-90 (2023) - [j29]Arpita Das, Pratima Panigrahi:
Independence number and the normalized Laplacian eigenvalue one. Discret. Math. Algorithms Appl. 15(8): 2250174:1-2250174:13 (2023) - 2022
- [j28]Saraswati Bajaj, Pratima Panigrahi:
Universal adjacency spectrum of zero divisor graph on the ring and its complement. AKCE Int. J. Graphs Comb. 19(1): 1-17 (2022) - [j27]Nibedita Mandal, Pratima Panigrahi:
L(2, 1)-coloring and irreducible no-hole coloring of lexicographic product of graphs. AKCE Int. J. Graphs Comb. 19(2): 133-140 (2022) - 2020
- [j26]Nibedita Mandal, Pratima Panigrahi:
On irreducible no-hole L(2, 1)-coloring of Cartesian product of trees with paths. AKCE Int. J. Graphs Comb. 17(3): 1052-1058 (2020) - [j25]Nibedita Mandal, Pratima Panigrahi:
L(2, 1)-colorings and irreducible no-hole colorings of the direct product of graphs. Discret. Appl. Math. 280: 186-200 (2020) - [c5]Priyanka Singh, Pratima Panigrahi, Aakash Singh:
Self-centeredness of Generalized Petersen Graphs. CALDAM 2020: 141-155
2010 – 2019
- 2019
- [j24]Laxman Saha, Pratima Panigrahi:
A new graph radio k-coloring algorithm. Discret. Math. Algorithms Appl. 11(1): 1950005:1-1950005:10 (2019) - 2018
- [j23]Arpita Das, Pratima Panigrahi:
Normalized Laplacian spectrum of some subdivision-joins and R-joins of two regular graphs. AKCE Int. J. Graphs Comb. 15(3): 261-270 (2018) - [j22]Nibedita Mandal, Pratima Panigrahi:
Irreducible no-hole L(2, 1)-coloring of edge-multiplicity-paths-replacement graph. Discuss. Math. Graph Theory 38(2): 525-552 (2018) - [j21]Fouzul Atik, Pratima Panigrahi:
Bounds on Maximal and Minimal Entries of the p-Normalized Principal Eigenvector of the Distance and Distance Signless Laplacian Matrices of Graphs. Graphs Comb. 34(5): 1019-1035 (2018) - 2017
- [j20]Sriparna Chattopadhyay, Pratima Panigrahi:
On Sum of Powers of the Laplacian Eigenvalues of Power Graphs of Certain Finite Groups. Electron. Notes Discret. Math. 63: 137-143 (2017) - [j19]Priyanka Singh, Pratima Panigrahi:
On self-centeredness of tensor product of some graphs. Electron. Notes Discret. Math. 63: 333-342 (2017) - [j18]Nibedita Mandal, Pratima Panigrahi:
L(2, 1)-colorings and Irreducible No-hole Colorings of Cartesian Product of Graphs. Electron. Notes Discret. Math. 63: 343-352 (2017) - [j17]Nibedita Mandal, Pratima Panigrahi:
On irreducible no-hole L(2, 1)-coloring of subdivision of graphs. J. Comb. Optim. 33(4): 1421-1442 (2017) - 2016
- [j16]Nibedita Mandal, Pratima Panigrahi:
Solutions of some L(2, 1)-coloring related open problems. Discuss. Math. Graph Theory 36(2): 279-297 (2016) - [c4]Fouzul Atik, Pratima Panigrahi:
Distance Spectral Radius of Some k-partitioned Transmission Regular Graphs. CALDAM 2016: 26-36 - [c3]Nibedita Mandal, Pratima Panigrahi:
On Irreducible No-hole L(2, 1)-labelings of Hypercubes and Triangular Lattices. CALDAM 2016: 254-263 - 2015
- [j15]Srinivasa Rao Kola, Pratima Panigrahi:
A Lower Bound for Radio $k$-chromatic Number of an Arbitrary Graph. Contributions Discret. Math. 10(2) (2015) - [j14]Laxman Saha, Pratima Panigrahi:
A lower bound for radio k-chromatic number. Discret. Appl. Math. 192: 87-100 (2015) - [j13]Laxman Saha, Pratima Panigrahi:
On the Radio Number of Square of Graphs. Electron. Notes Discret. Math. 48: 205-212 (2015) - [j12]Srinivasa Rao Kola, Pratima Panigrahi:
Radio Numbers of Some Caterpillars. Electron. Notes Discret. Math. 48: 289-296 (2015) - 2013
- [j11]Laxman Saha, Pratima Panigrahi:
On the radio number of toroidal grids. Australas. J Comb. 55: 273-288 (2013) - 2012
- [j10]Laxman Saha, Pratima Panigrahi:
Antipodal number of some powers of cycles. Discret. Math. 312(9): 1550-1557 (2012) - [c2]Laxman Saha, Pratima Panigrahi:
Improved Lower Bound for Radio Number of an Arbitrary Graph. CTW 2012: 228-231 - [c1]Laxman Saha, Pratima Panigrahi:
A Graph Radio k-Coloring Algorithm. IWOCA 2012: 125-129 - 2011
- [j9]Pratima Panigrahi, R. N. Mohapatra:
All primitive strongly regular graphs except four are hyperenergetic. Appl. Math. Lett. 24(12): 1995-1997 (2011) - [j8]Laxman Saha, Pratima Panigrahi, Pawan Kumar:
Improved Bounds for Radio k-Chromatic Number of Hypercube Qn. Int. J. Math. Math. Sci. 2011: 961649:1-961649:7 (2011) - 2010
- [j7]Srinivasa Rao Kola, Pratima Panigrahi:
An improved lower bound for the radio k-chromatic number of the hypercube Qn. Comput. Math. Appl. 60(7): 2131-2140 (2010)
2000 – 2009
- 2008
- [j6]Pratima Panigrahi, Debdas Mishra:
Graceful Lobsters Obtained from Diameter Four Trees Using Partitioning Technique. Ars Comb. 87 (2008) - [j5]Debdas Mishra, Pratima Panigrahi:
Some graceful lobsters with all three types of branches incident on the vertices of the central path. Comput. Math. Appl. 56(5): 1382-1394 (2008) - 2006
- [j4]Debdas Mishra, Pratima Panigrahi:
Graceful Lobsters Obtained by Component Moving of Diameter Four Trees. Ars Comb. 81 (2006) - 2003
- [j3]R. Badrinath, Pratima Panigrahi:
Graceful Labeling of Balanced Stars of Paths. Electron. Notes Discret. Math. 15: 31-33 (2003) - 2000
- [j2]Pratima Panigrahi:
The Non-Collinearity Graph of the (8, 2) Quadric Is Uniquely Geometrisable. Des. Codes Cryptogr. 20(3): 307-317 (2000)
1990 – 1999
- 1998
- [j1]Pratima Panigrahi:
The Collinearity Graph of the O-(8, 2) Quadric Is Not Geometrisable. Des. Codes Cryptogr. 13(2): 187-198 (1998)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-05 20:17 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
