Zobrazeno 1 - 10
of 44
pro vyhledávání: '"Tomoki Nakamigawa"'
Autor:
Yoshiaki Doi, Norio Konno, Tomoki Nakamigawa, Tadashi Sakuma, Etsuo Segawa, Hidehiro Shinohara, Shunya Tamura, Yuuho Tanaka, Kosuke Toyota
Publikováno v:
Discrete Applied Mathematics. 313:18-28
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^2_N$ of an $N$-vertex cycle graph $C_N$ was given by N. Chair [\textit{Journal of Statistical Physics}
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::cf9021b6a64a754cdaf9276309cbbdf4
https://doi.org/10.1016/j.dam.2022.01.001
https://doi.org/10.1016/j.dam.2022.01.001
Autor:
Naoki Matsumoto, Tomoki Nakamigawa
Publikováno v:
Discrete Applied Mathematics. 298:155-164
Recently, the authors introduced a game invariant of graphs, called a game connectivity. In this paper, we investigate the edge version of the invariant, called a game edge-connectivity, by introducing a new combinatorial game on a graph, called a gr
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::f69f0696b874d1936abb4145c4693d9c
https://doi.org/10.1016/j.dam.2021.04.005
https://doi.org/10.1016/j.dam.2021.04.005
Autor:
Tomoki Nakamigawa
Publikováno v:
Ars Mathematica Contemporanea. 18:381-391
A chord diagram E is a set of chords of a circle such that no pair of chords has a common endvertex. Let v 1 , v 2 , …, v 2 n be a sequence of vertices arranged in clockwise order along a circumference. A chord diagram { v 1 v n + 1 , v 2 v n + 2 ,
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::b117997a42f686646ea69a315587379a
https://doi.org/10.26493/1855-3974.2239.7f1
https://doi.org/10.26493/1855-3974.2239.7f1
Publikováno v:
Graphs and Combinatorics. 36:51-62
We introduce a new combinatorial game of a weighted point set P on the plane in general position, called a convex grabbing game. In the game, two players alternately remove a point on the convex hull of P and obtain the weight of the removed point as
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::c1b446c0e0d1ba0c929be6bdefb50f25
https://doi.org/10.1007/s00373-019-02117-z
https://doi.org/10.1007/s00373-019-02117-z
Autor:
Tomoki Nakamigawa
Publikováno v:
Discrete Mathematics & Theoretical Computer Science, Vol DMTCS Proceedings vol. AE,..., Iss Proceedings (2005)
It is proved that any graph of order $14n/3 + O(1)$ contains a family of n induced subgraphs of order $3$ such that they are vertex-disjoint and equivalent to each other.
Externí odkaz:
https://doaj.org/article/b3f5311e6f8141269ba0dbef2452cf89
Autor:
Tomoki Nakamigawa, Tadashi Sakuma
Publikováno v:
Electronic Notes in Discrete Mathematics. 61:917-923
A chord diagram is a set of chords of a circle such that no pair of chords has a common endvertex. A chord diagram E is called nonintersecting if E contains no crossing. For a chord diagram E having a crossing S = { x 1 x 3 , x 2 x 4 } , the expansio
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::9666381900bcd283cd787d5e685b8009
https://doi.org/10.1016/j.endm.2017.07.054
https://doi.org/10.1016/j.endm.2017.07.054
Publikováno v:
European Journal of Combinatorics. 95:103325
A graph puzzle ${\rm Puz}(G)$ of a graph $G$ is defined as follows. A configuration of ${\rm Puz}(G)$ is a bijection from the set of vertices of a board graph to the set of vertices of a pebble graph, both graphs being isomorphic to some input graph
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::461ca28d466d233e6800d24bc9562ca7
https://doi.org/10.1016/j.ejc.2021.103325
https://doi.org/10.1016/j.ejc.2021.103325
Autor:
Tomoki Nakamigawa
Publikováno v:
Electronic Notes in Discrete Mathematics. 54:51-56
A chord diagram is a set of chords of a circle such that no pair of chords has a common endvertex. A pair of chords is called a crossing if the two chords intersect. A chord diagram E is called nonintersecting if E contains no crossing. For a chord d
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::42c42f748713ebca1fa75dc64c2437a0
https://doi.org/10.1016/j.endm.2016.09.010
https://doi.org/10.1016/j.endm.2016.09.010
Autor:
Tomoki Nakamigawa
Publikováno v:
Discrete Mathematics. 339:1699-1705
For a graph G and a family H of graphs, a vertex partition of G is called an H -decomposition, if every part induces a graph isomorphic to one of H . For 1 ? a ? k , let A ( k , a ) denote the graph which is a join of an empty graph of order a and a
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::368b575ea7d0483181ad7c08c605693b
https://doi.org/10.1016/j.disc.2016.01.012
https://doi.org/10.1016/j.disc.2016.01.012
Autor:
Naoki Matsumoto, Tomoki Nakamigawa
Publikováno v:
Discrete Mathematics. 343:112104
In this paper, we introduce a new game invariant of graphs, called game connectivity, which is related to the connectivity of graphs. We investigate many fundamental and significant topics of the game connectivity of graphs, and propose many open pro
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::34c16baeacbadc63d9fd2a0f4645731e
https://doi.org/10.1016/j.disc.2020.112104
https://doi.org/10.1016/j.disc.2020.112104