Tomoki Nakamigawa

activity

20122021

collaborators

3 papers

math.CO2021

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 $C_{N}^{2}$ of an $N$ -vertex cycle grap…

cs.DM2019

Pebble Exchange Group of Graphs

Tatsuoki Kato, Tomoki Nakamigawa, Tadashi Sakuma

A graph puzzle $Puz (G)$ of a graph $G$ is defined as follows. A configuration of $Puz (G)$ is a bijection from the set of vertices of a board graph to the set of vertice…

math.CO2012

Agent Arrangement Problem

Tomoki Nakamigawa, Tadashi Sakuma

An {\em arrangement} of an ordered pair $(G_{A}, G_{M})$ of graphs is defined as a function $f$ from $V (G_{A})$ to $V (G_{M})$ such that, for each vertex $c$ of $G_{M}$ , the vertex-set $f^{-1…