default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDPranava K. Jha
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j32]Pranava K. Jha
:
A note on the connectivity of the exchanged hypercube. Discret. Math. Algorithms Appl. 16(1): 2275001:1-2275001:12 (2024)- 2023
- [j31]Pranava K. Jha:
Optimal embeddings of the exchanged hypercube and the dual-cube as vertex-induced subgraphs of the hypercube. Discret. Appl. Math. 337: 218-231 (2023) - [j30]Pranava K. Jha:
Vertex transitivity and distance metric of the quad-cube. J. Supercomput. 79(13): 13952-13970 (2023) - 2022
- [j29]Pranava K. Jha:
1-Perfect Codes Over the Quad-Cube. IEEE Trans. Inf. Theory 68(10): 6481-6504 (2022) - [j28]Pranava K. Jha:
Vertex transitivity, distance metric, and hierarchical structure of the dual-cube. J. Supercomput. 78(16): 17758-17775 (2022)
2010 – 2019
- 2018
- [j27]Pranava K. Jha:
Efficient eight-regular circulants based on the Kronecker product. Discret. Appl. Math. 243: 207-218 (2018) - 2016
- [j26]Pranava K. Jha:
A family of efficient six-regular circulants representable as a Kronecker product. Discret. Appl. Math. 203: 72-84 (2016) - 2015
- [j25]Pranava K. Jha, Jonathan D. H. Smith:
Cycle Kronecker products that are representable as optimal circulants. Discret. Appl. Math. 181: 130-138 (2015) - [j24]Pranava K. Jha:
A comment on "The domination number of exchanged hypercubes". Inf. Process. Lett. 115(2): 343-344 (2015) - [j23]Pranava K. Jha:
1-Perfect Codes Over Dual-Cubes vis-à-vis Hamming Codes Over Hypercubes. IEEE Trans. Inf. Theory 61(8): 4259-4268 (2015) - 2014
- [j22]Pranava K. Jha:
Dense bipartite circulants and their routing via rectangular twisted torus. Discret. Appl. Math. 166: 141-158 (2014) - [j21]Pranava K. Jha:
Tight-optimal circulants vis-à-vis twisted tori. Discret. Appl. Math. 175: 24-34 (2014) - 2013
- [j20]Pranava K. Jha:
Dimension-Order Routing Algorithms for a Family of Minimal-Diameter circulants. J. Interconnect. Networks 14(1) (2013) - [j19]Pranava K. Jha:
Comments on "Multiple-Radix Gray Codes in Lee Metric". IEEE Trans. Computers 62(1): 200 (2013) - [i1]Pranava K. Jha:
Comments on "Resource placement in Cartesian product of networks" [Imani, Sarbazi-Azad and Zomaya, J. Parallel Distrib. Comput., 70 (2010) 481-495]. CoRR abs/1302.5646 (2013) - 2012
- [j18]Pranava K. Jha, Savitri Devisetty:
Orthogonal drawings and crossing numbers of the Kronecker product of two cycles. J. Parallel Distributed Comput. 72(2): 195-204 (2012) - [j17]Pranava K. Jha, Rachna Prasad:
Hamiltonian Decomposition of the Rectangular Twisted Torus. IEEE Trans. Parallel Distributed Syst. 23(8): 1504-1507 (2012)
2000 – 2009
- 2009
- [j16]Laurent Beaudou, Paul Dorbec, Sylvain Gravier, Pranava K. Jha:
On Planarity of Direct Product of multipartite Complete Graphs. Discret. Math. Algorithms Appl. 1(1): 85-104 (2009) - 2008
- [j15]Md. Enamul Haque, Pranava K. Jha:
L(j, , k) -Labelings of Kronecker Products of Complete Graphs. IEEE Trans. Circuits Syst. II Express Briefs 55-II(1): 70-73 (2008) - 2005
- [j14]Pranava K. Jha, Sandi Klavzar, Aleksander Vesel:
L(2, 1)-labeling of direct product of paths and cycles. Discret. Appl. Math. 145(2): 317-325 (2005) - [j13]Pranava K. Jha, Sandi Klavzar, Aleksander Vesel:
Optimal L(d, 1)-labelings of certain direct products of cycles and Cartesian products of cycles. Discret. Appl. Math. 152(1-3): 257-265 (2005) - [j12]Bostjan Bresar, Pranava K. Jha, Sandi Klavzar, Blaz Zmazek:
Median and quasi-median direct products of graphs. Discuss. Math. Graph Theory 25(1-2): 183-196 (2005) - 2003
- [j11]Pranava K. Jha:
Perfect r-domination in the Kronecker product of two cycles, with an application to diagonal/toroidal mesh. Inf. Process. Lett. 87(3): 163-168 (2003) - [j10]Pranava K. Jha:
A Counterexample to Tang and Padubidri's Claim about the Bisection Width of a Diagonal Mesh. IEEE Trans. Computers 52(5): 676-677 (2003) - 2001
- [j9]Pranava K. Jha:
Smallest independent dominating sets in Kronecker products of cycles. Discret. Appl. Math. 113(2-3): 303-306 (2001) - 2000
- [j8]S. Aggarwal, Pranava K. Jha, M. Vikram:
Distance regularity in direct-product graphs. Appl. Math. Lett. 13(1): 51-55 (2000) - [j7]Pranava K. Jha, Ashok Narayanan, Puneet Sood, Karthik Sundaram, Vivek Sunder:
On L(2, 1)-labeling of the Cartesian product of a cycle and a path. Ars Comb. 55 (2000) - [j6]Pranava K. Jha:
Further Results on Independence in Direct-Product Graphs. Ars Comb. 56 (2000)
1990 – 1999
- 1998
- [j5]Pranava K. Jha, Sandi Klavzar:
Independence in Direct-Product Graphs. Ars Comb. 50 (1998) - [j4]Pranava K. Jha:
Kronecker products of paths and cycles: Decomposition, factorization and bi-pancyclicity. Discret. Math. 182(1-3): 153-167 (1998) - 1997
- [j3]Pranava K. Jha, Naveen Agnihotri, Rajesh Kumar Arora:
Long Cycles and Long Paths in the Kronecker Product of a Cycle, a Tree. Discret. Appl. Math. 74(2): 101-121 (1997) - [j2]Pranava K. Jha, Sandi Klavzar, Blaz Zmazek:
Isomorphic components of Kronecker product of bipartite graphs. Discuss. Math. Graph Theory 17(2): 301-309 (1997) - 1995
- [j1]Pranava K. Jha, Giora Slutzki:
A Scheme to Construct Distance Three Codes Using Latin Squares, with Applications to the n-Cube. Inf. Process. Lett. 55(3): 123-127 (1995)
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-04-24 23:05 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:
