Pranava K. Jha

Orcid: 0000-0002-2059-7436

According to our database1, Pranava K. Jha authored at least 33 papers between 1995 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
A note on the connectivity of the exchanged hypercube.
Discret. Math. Algorithms Appl., January, 2024

2023
Optimal embeddings of the exchanged hypercube and the dual-cube as vertex-induced subgraphs of the hypercube.
Discret. Appl. Math., October, 2023

Vertex transitivity and distance metric of the quad-cube.
J. Supercomput., September, 2023

2022
Vertex transitivity, distance metric, and hierarchical structure of the dual-cube.
J. Supercomput., 2022

1-Perfect Codes Over the Quad-Cube.
IEEE Trans. Inf. Theory, 2022

2018
Efficient eight-regular circulants based on the Kronecker product.
Discret. Appl. Math., 2018

2016
A family of efficient six-regular circulants representable as a Kronecker product.
Discret. Appl. Math., 2016

2015
1-Perfect Codes Over Dual-Cubes vis-à-vis Hamming Codes Over Hypercubes.
IEEE Trans. Inf. Theory, 2015

A comment on "The domination number of exchanged hypercubes".
Inf. Process. Lett., 2015

Cycle Kronecker products that are representable as optimal circulants.
Discret. Appl. Math., 2015

2014
Tight-optimal circulants vis-à-vis twisted tori.
Discret. Appl. Math., 2014

Dense bipartite circulants and their routing via rectangular twisted torus.
Discret. Appl. Math., 2014

2013
Comments on "Multiple-Radix Gray Codes in Lee Metric".
IEEE Trans. Computers, 2013

Dimension-Order Routing Algorithms for a Family of Minimal-Diameter circulants.
J. Interconnect. Networks, 2013

Comments on "Resource placement in Cartesian product of networks" [Imani, Sarbazi-Azad and Zomaya, J. Parallel Distrib. Comput., 70 (2010) 481-495]
CoRR, 2013

2012
Hamiltonian Decomposition of the Rectangular Twisted Torus.
IEEE Trans. Parallel Distributed Syst., 2012

Orthogonal drawings and crossing numbers of the Kronecker product of two cycles.
J. Parallel Distributed Comput., 2012

2009
On Planarity of Direct Product of multipartite Complete Graphs.
Discret. Math. Algorithms Appl., 2009

2008
L(j, , k) -Labelings of Kronecker Products of Complete Graphs.
IEEE Trans. Circuits Syst. II Express Briefs, 2008

2005
Median and quasi-median direct products of graphs.
Discuss. Math. Graph Theory, 2005

Optimal <i>L</i>(<i>d</i>, 1)-labelings of certain direct products of cycles and Cartesian products of cycles.
Discret. Appl. Math., 2005

<i>L</i>(2, 1)-labeling of direct product of paths and cycles.
Discret. Appl. Math., 2005

2003
A Counterexample to Tang and Padubidri's Claim about the Bisection Width of a Diagonal Mesh.
IEEE Trans. Computers, 2003

Perfect r-domination in the Kronecker product of two cycles, with an application to diagonal/toroidal mesh.
Inf. Process. Lett., 2003

2001
Smallest independent dominating sets in Kronecker products of cycles.
Discret. Appl. Math., 2001

2000
On L(2, 1)-labeling of the Cartesian product of a cycle and a path.
Ars Comb., 2000

Further Results on Independence in Direct-Product Graphs.
Ars Comb., 2000

Distance regularity in direct-product graphs.
Appl. Math. Lett., 2000

1998
Kronecker products of paths and cycles: Decomposition, factorization and bi-pancyclicity.
Discret. Math., 1998

Independence in Direct-Product Graphs.
Ars Comb., 1998

1997
Isomorphic components of Kronecker product of bipartite graphs.
Discuss. Math. Graph Theory, 1997

Long Cycles and Long Paths in the Kronecker Product of a Cycle, a Tree.
Discret. Appl. Math., 1997

1995
A Scheme to Construct Distance Three Codes Using Latin Squares, with Applications to the n-Cube.
Inf. Process. Lett., 1995


  Loading...