Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDP. Paulraja
Person information
- affiliation: Kalasalingam University, Krishnankoil, India
- affiliation (former): Annamalai University, Annamalainagar, India
- affiliation (former): Simon Fraser University, Burnaby, BC, Canada
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2021
[j44]S. Ganesamurthy, R. S. Manikandan, P. Paulraja:
Decompositions of some classes of regular graphs and digraphs into cycles of length 4p. Australas. J Comb. 79: 215-233 (2021)- [j43]P. Paulraja, R. Srimathi:
Decomposition of the tensor product of complete graphs into cycles of lengths 3 and 6. Discuss. Math. Graph Theory 41(1): 249-266 (2021) - [j42]S. Ganesamurthy
, P. Paulraja:
Decompositions of Some Classes of Dense Graphs into Cycles of Lengths 4 and 8. Graphs Comb. 37(4): 1291-1310 (2021) - 2020
- [j41]P. Paulraja, R. Srimathi:
Maximum packing and minimum covering of the line graph of the complete graph with kite. Australas. J Comb. 76: 105-127 (2020) - [j40]P. Paulraja, R. Srimathi:
Decompositions of complete equipartite graphs into cycles of lengths 3 and 6. Australas. J Comb. 78: 297-313 (2020)
2010 – 2019
- 2019
- [j39]R. S. Manikandan, P. Paulraja, T. Sivakaran:
p2-cycle decompositions of the tensor product of complete graphs. Australas. J Comb. 73: 107-131 (2019) - [j38]S. Ganesamurthy, P. Paulraja:
Decompositions of complete tripartite graphs into cycles of lengths 3 and 6. Australas. J Comb. 73: 220-241 (2019) - [j37]R. Balakrishnan, P. Paulraja, Wasin So, M. Vinay:
Some properties of the Knödel graph W(k, 2k), k≥4. Australas. J Comb. 74: 17-32 (2019) - [j36]S. Ganesamurthy, P. Paulraja:
A C5-decomposition of the λ-fold line graph of the complete graph. Discret. Math. 342(9): 2726-2732 (2019) - [j35]S. Ganesamurthy, P. Paulraja, R. Srimathi:
Multidecompositions of line graphs of complete graphs. Discret. Math. Algorithms Appl. 11(3): 1950035:1-1950035:13 (2019) - [j34]P. Paulraja, T. Sivakaran:
Decompositions of some regular graphs into unicyclic graphs of order five. Discret. Math. Algorithms Appl. 11(4): 1950042:1-1950042:34 (2019) - 2018
- [j33]S. Ganesamurthy, P. Paulraja:
Existence of a P2k+1-decomposition in the Kneser graph KGt, 2. Discret. Math. 341(7): 2113-2116 (2018) - [j32]S. Ganesamurthy, P. Paulraja:
2p-cycle decompositions of some regular graphs and digraphs. Discret. Math. 341(8): 2197-2210 (2018) - 2017
- [j31]R. S. Manikandan, P. Paulraja:
C7-decompositions of the tensor product of complete graphs. Discuss. Math. Graph Theory 37(3): 523-535 (2017) - 2016
- [j30]Palanivel Subramania Nadar Paulraja, S. Sampath Kumar:
Edge Disjoint Hamilton Cycles in Knödel Graphs. Discret. Math. Theor. Comput. Sci. 17(3): 263-284 (2016) - [c1]P. Paulraja, K. Raja Chandrasekar:
Dominator Colorings of Products of Graphs. ICTCSDM 2016: 242-250 - 2015
- [j29]K. Pattabiraman, P. Paulraja:
Harary index of product graphs. Discuss. Math. Graph Theory 35(1): 17-33 (2015) - 2014
- [j28]P. Paulraja, V. Sheeba Agnes:
Degree Distance of Product graphs. Discret. Math. Algorithms Appl. 6(1) (2014) - [j27]P. Paulraja, V. Sheeba Agnes:
Gutman index of product graphs. Discret. Math. Algorithms Appl. 6(4) (2014) - 2013
- [j26]P. Paulraja, V. Sheeba Agnes:
Connectivity of Tensor Product of graphs. Discret. Math. Algorithms Appl. 5(4) (2013) - 2012
- [j25]K. Pattabiraman, P. Paulraja:
On some topological indices of the tensor products of graphs. Discret. Appl. Math. 160(3): 267-279 (2012) - [j24]K. Pattabiraman, P. Paulraja:
Vertex and edge Padmakar-Ivan indices of the generalized hierarchical product of graphs. Discret. Appl. Math. 160(9): 1376-1384 (2012) - [j23]Palanivel Subramania Nadar Paulraja, S. Sampath Kumar:
Closed trail decompositions of some classes of regular graphs. Discret. Math. 312(7): 1353-1366 (2012) - [j22]K. Pattabiraman, P. Paulraja:
Wiener and vertex PI indices of the strong product of graphs. Discuss. Math. Graph Theory 32(4): 749-769 (2012) - 2011
- [j21]R. S. Manikandan, P. Paulraja, S. Sivasankar:
Directed Hamilton cycle decompositions of the tensor product of symmetric digraphs. Ars Comb. 98: 379-386 (2011) - [j20]Palanivel Subramania Nadar Paulraja, S. Sampath Kumar:
Resolvable even cycle decompositions of the tensor product of complete graphs. Discret. Math. 311(16): 1841-1850 (2011) - [j19]K. Pattabiraman, P. Paulraja:
Wiener index of the tensor product of a path and a cycle. Discuss. Math. Graph Theory 31(4): 737-751 (2011) - 2010
- [j18]R. S. Manikandan, P. Paulraja:
Hamilton cycle decompositions of the tensor products of complete bipartite graphs and complete multipartite graphs. Discret. Math. 310(21): 2776-2789 (2010)
2000 – 2009
- 2009
- [j17]R. Lakshmi, P. Paulraja:
On Optimal Orientations Of Tensor Product Of Graphs And Circulant Graphs. Ars Comb. 92 (2009) - [j16]P. Paulraja, S. Sivasankar:
Directed Hamilton Cycle Decompositions of the Tensor Products of Symmetric Digraphs. Graphs Comb. 25(4): 571-581 (2009) - 2008
- [j15]R. S. Manikandan, P. Paulraja:
Hamilton cycle decompositions of the tensor product of complete multipartite graphs. Discret. Math. 308(16): 3586-3606 (2008) - 2007
- [j14]R. S. Manikandan, P. Paulraja:
C5-decompositions of the tensor product of complete graphs. Australas. J Comb. 37: 285-294 (2007) - [j13]R. Lakshmi, P. Paulraja:
On Optimal Orientations Of Tensor Product Of Complete Graphs. Ars Comb. 82 (2007) - 2006
- [j12]R. S. Manikandan, P. Paulraja:
Hamiltonian decompositions of the tensor product of a complete graph and a complete bipartite graph. Ars Comb. 80 (2006) - [j11]R. S. Manikandan, P. Paulraja:
Cp-decompositions of some regular graphs. Discret. Math. 306(4): 429-451 (2006) - 2004
- [j10]P. Paulraja, N. Varadarajan:
Plane Triangulations in Product Graphs. Ars Comb. 71 (2004) - [j9]P. Paulraja, N. Varadarajan:
Independent Sets And Matchings In Tensor Product Of Graphs. Ars Comb. 72 (2004) - 2003
- [j8]R. Balakrishnan, Jean-Claude Bermond, P. Paulraja, Min-Li Yu:
On Hamilton cycle decompositions of the tensor product of complete graphs. Discret. Math. 268(1-3): 49-58 (2003)
1990 – 1999
- 1999
- [j7]Appu Muthusamy, P. Paulraja:
Path factorizations of complete multipartite graphs. Discret. Math. 195(1-3): 181-201 (1999) - 1998
- [j6]R. Balakrishnan, P. Paulraja:
Hamilton cycles in tensor product of graphs. Discret. Math. 186(1-3): 1-13 (1998) - 1995
- [j5]Appu Muthusamy, P. Paulraja:
Factorizations of product graphs into cycles of uniform length. Graphs Comb. 11(1): 69-90 (1995) - [j4]Appu Muthusamy, P. Paulraja:
Hamilton Cycle Decomposition of Line Graphs and a Conjecture of Bermond. J. Comb. Theory, Ser. B 64(1): 1-16 (1995) - 1993
- [j3]P. Paulraja:
A characterization of Hamiltonian prisms. J. Graph Theory 17(2): 161-171 (1993)
1980 – 1989
- 1987
- [j2]P. Paulraja:
Counterexample to a conjecture on Hamilton cycles. Discret. Math. 64(1): 99 (1987) - 1984
- [j1]R. Balakrishnan, P. Paulraja:
Note on the existence of directed (k + 1)-cycles in diconnected complete k-partite digraphs. J. Graph Theory 8(3): 423-426 (1984)
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 2023-10-01 22:27 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:
