1 citations · 1 across the 9 of their papers we have counts for
10 papers
Structural Origins of Cubic Complexity in Pebble Motion
Tomoki Nakamigawa, Tadashi Sakuma
The pebble motion problem (PMP) asks whether one configuration of labeled pebbles on a graph can be transformed into another by moving pebbles to adjacent unoccupied vertices. It i…
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…
Tutte polynomial, complete invariant, and theta series
Misaki Kume, Tsuyoshi Miezaki, Tadashi Sakuma +1
In this study, we present two results that relate Tutte polynomials. First, we provide new and complete polynomial invariants for graphs. We note that the number of variables of ou…
Stable structure on safe set problems in vertex-weighted graphs
Shinya Fujita, Tadashi Sakuma, Boram Park
Let be a graph, and let be a positive real-valued weight function on . For every subset of , let A non-empty subset $S \subset V…
Pebble Exchange Group of Graphs
Tatsuoki Kato, Tomoki Nakamigawa, Tadashi Sakuma
A graph puzzle of a graph is defined as follows. A configuration of is a bijection from the set of vertices of a board graph to the set of vertice…
A generalization of the Tutte polynomials
Tsuyoshi Miezaki, Manabu Oura, Tadashi Sakuma +1
In this paper, we introduce the concept of the Tutte polynomials of genus and discuss some of its properties. We note that the Tutte polynomials of genus one are well-known Tut…
On the weighted safe set problem on paths and cycles
Shinya Fujita, Tommy Jensen, Boram Park +1
Let be a graph, and let be a weight function on the vertices of . For every subset of , let A non-empty subset…
Agent Arrangement Problem
Tomoki Nakamigawa, Tadashi Sakuma
An {\em arrangement} of an ordered pair of graphs is defined as a function from to such that, for each vertex of , the vertex-set $f^{-1…
On the balanced decomposition number
Tadashi Sakuma
A {\em balanced coloring} of a graph means a triple of mutually disjoint subsets of the vertex-set such that and $|P_1|=|P…
On ideal minimally non-packing clutters
Kenji Kashiwabara, Tadashi Sakuma
We consider the following conjecture proposed by Cornuéjols, Guenin and Margot: every ideal minimally non-packing clutter has a transversal of size 2. For a clutter C, the tilde cl…