1 citations · 1 across the 6 of their papers we have counts for
7 papers
On the average hitting times of weighted Cayley graphs
Yuuho Tanaka
In this paper, we give exact formulas for the average hitting times of random walks from one vertex to any other vertex on certain weighted Cayley graphs.
A criterion for determining whether multiple shells support a -design
Madoka Awada, Reina Ishikawa, Tsuyoshi Miezaki +1
In this paper, we provide a criterion for determining whether multiple shells support a -design. We construct as a corollary an infinite series of -designs using power residu…
Jacobi polynomials and design theory II
Himadri Chakraborty, Reina Ishikawa, Yuuho Tanaka
In this paper, we introduce some new polynomials associated to linear codes over . In particular, we introduce the notion of split complete Jacobi polynomials attac…
On the average hitting times of Cay()
Yuuho Tanaka
The exact formula for the average hitting time (HT, as an abbreviation) of simple random walks on Cay() was given by Y. Doi et al. [Discrete Applied Mathematics,…
Convex subgraphs and spanning trees of the square cycles
Akihiro Munemasa, Yuuho Tanaka
We classify connected spanning convex subgraphs of the square cycles. We then show that every spanning tree of is contained in a unique nontrivial connected spanning convex…
Jacobi polynomials and design theory I
Himadri Shekhar Chakraborty, Tsuyoshi Miezaki, Manabu Oura +1
In this paper, we introduce the notion of Jacobi polynomials with multiple reference vectors of a code, and give the MacWilliams type identity for it. Moreover, we derive a formula…
On the average hitting times of the squares of cycles
Yoshiaki Doi, Norio Konno, Tomoki Nakamigawa +6
The exact formula for the average hitting time (HT, as an abbreviation) of simple random walks from one vertex to any other vertex on the square of an -vertex cycle grap…