Pranava K. Jha - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 31 from 31

2024

A note on the connectivity of the exchanged hypercubePranava K. Jha. dmaa, 16(1), January 2024. [doi]

2023

Optimal embeddings of the exchanged hypercube and the dual-cube as vertex-induced subgraphs of the hypercubePranava K. Jha. DAM, 337:218-231, October 2023. [doi]

Vertex transitivity and distance metric of the quad-cubePranava K. Jha. tjs, 79(13):13952-13970, September 2023. [doi]

2022

Vertex transitivity, distance metric, and hierarchical structure of the dual-cubePranava K. Jha. tjs, 78(16):17758-17775, 2022. [doi]

1-Perfect Codes Over the Quad-CubePranava K. Jha. TIT, 68(10):6481-6504, 2022. [doi]

2018

Efficient eight-regular circulants based on the Kronecker productPranava K. Jha. DAM, 243:207-218, 2018. [doi]

2016

A family of efficient six-regular circulants representable as a Kronecker productPranava K. Jha. DAM, 203:72-84, 2016. [doi]

2015

A comment on "The domination number of exchanged hypercubes"Pranava K. Jha. ipl, 115(2):343-344, 2015. [doi]

Cycle Kronecker products that are representable as optimal circulantsPranava K. Jha, Jonathan D. H. Smith. DAM, 181:130-138, 2015. [doi]

1-Perfect Codes Over Dual-Cubes vis-à-vis Hamming Codes Over HypercubesPranava K. Jha. TIT, 61(8):4259-4268, 2015. [doi]

2014

Tight-optimal circulants vis-à-vis twisted toriPranava K. Jha. DAM, 175:24-34, 2014. [doi]

Dense bipartite circulants and their routing via rectangular twisted torusPranava K. Jha. DAM, 166:141-158, 2014. [doi]

2013

Dimension-Order Routing Algorithms for a Family of Minimal-Diameter circulantsPranava K. Jha. join, 14(1), 2013. [doi]

Comments on "Multiple-Radix Gray Codes in Lee Metric"Pranava K. Jha. TC, 62(1):200, 2013. [doi]

2012

Orthogonal drawings and crossing numbers of the Kronecker product of two cyclesPranava K. Jha, Savitri Devisetty. jpdc, 72(2):195-204, 2012. [doi]

Hamiltonian Decomposition of the Rectangular Twisted TorusPranava K. Jha, Rachna Prasad. tpds, 23(8):1504-1507, 2012. [doi]

2009

On Planarity of Direct Product of multipartite Complete GraphsLaurent Beaudou, Paul Dorbec, Sylvain Gravier, Pranava K. Jha. dmaa, 1(1):85-104, 2009. [doi]

2008

L(j, , k) -Labelings of Kronecker Products of Complete GraphsM. Enamul Haque, Pranava K. Jha. tcas, 55-II(1):70-73, 2008. [doi]

2005

Median and quasi-median direct products of graphsBostjan Bresar, Pranava K. Jha, Sandi Klavzar, Blaz Zmazek. dmgt, 25(1-2):183-196, 2005. [doi]

Optimal ::::L::::(::::d::::, 1)-labelings of certain direct products of cycles and Cartesian products of cyclesPranava K. Jha, Sandi Klavzar, Aleksander Vesel. DAM, 152(1-3):257-265, 2005. [doi]

::::L::::(2, 1)-labeling of direct product of paths and cyclesPranava K. Jha, Sandi Klavzar, Aleksander Vesel. DAM, 145(2):317-325, 2005. [doi]

2003

Perfect r-domination in the Kronecker product of two cycles, with an application to diagonal/toroidal meshPranava K. Jha. ipl, 87(3):163-168, 2003. [doi]

A Counterexample to Tang and Padubidri s Claim about the Bisection Width of a Diagonal MeshPranava K. Jha. TC, 52(5):676-677, 2003. [doi]

2001

Smallest independent dominating sets in Kronecker products of cyclesPranava K. Jha. DAM, 113(2-3):303-306, 2001.

2000

On L(2, 1)-labeling of the Cartesian product of a cycle and a pathPranava K. Jha, Ashok Narayanan, Puneet Sood, Karthik Sundaram, Vivek Sunder. arscom, 55, 2000.

Further Results on Independence in Direct-Product GraphsPranava K. Jha. arscom, 56, 2000.

1998

Kronecker products of paths and cycles: Decomposition, factorization and bi-pancyclicityPranava K. Jha. DM, 182(1-3):153-167, 1998. [doi]

Independence in Direct-Product GraphsPranava K. Jha, Sandi Klavzar. arscom, 50, 1998.

1997

Isomorphic components of Kronecker product of bipartite graphsPranava K. Jha, Sandi Klavzar, Blaz Zmazek. dmgt, 17(2):301-309, 1997. [doi]

Long Cycles and Long Paths in the Kronecker Product of a Cycle, a TreePranava K. Jha, Naveen Agnihotri, Rajesh Kumar. DAM, 74(2):101-121, 1997. [doi]

1995

A Scheme to Construct Distance Three Codes Using Latin Squares, with Applications to the n-CubePranava K. Jha, Giora Slutzki. ipl, 55(3):123-127, 1995. [doi]

Sign in or sign up to see more results.

runs on WebDSL