3 papers
math.CO2026
Effective Resistance and Generalized Bejaia-Pisa Sequences on Complete Graphs with Circulant Distance Deletions
Shunya Tamura, Yuuho Tanaka
In this paper, we investigate the effective resistance on the graph , which is obtained by deleting all edges corresponding to circular distances $\{\pm1, \pm2, \dots, \…
math.CO2026
Spanning trees in directed square cycles
Yuuho Tanaka
We classify weakly connected spanning closed (WCSC) subgraphs of , the square of a directed -vertex cycle. Then we show that every spanning tree of $\ove…
math.CO2025
Number of spanning trees in a wheel graph with two identified vertices via hitting times
Shunya Tamura, Yuuho Tanaka
In this paper, we provide an exact formula for the average hitting times in a wheel graph using a combinatorial approach. For this wheel graph, the average hitting times…