Zobrazeno 1 - 10
of 39
pro vyhledávání: '"Tadashi Sakuma"'
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
Publikováno v:
Graphs and Combinatorics. 37:1545-1558
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 our polynomials is one. Second, let L_1 and L_2 be two non-isomorphic la
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::d028380425902e2a5f8eefefeaf7b159
https://doi.org/10.1007/s00373-020-02238-w
https://doi.org/10.1007/s00373-020-02238-w
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
Publikováno v:
Graph-Theoretic Concepts in Computer Science ISBN: 9783030604394
WG
WG
Let G be a graph, and let w be a non-negative real-valued weight function on V(G). For every subset X of V(G), let \(w(X)=\sum _{v \in X} w(v).\) A non-empty subset \(S \subset V(G)\) is a weighted safe set of (G, w) if for every component C of the s
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::e98d48ef9949751120888db3d1db2fc4
https://doi.org/10.1007/978-3-030-60440-0_29
https://doi.org/10.1007/978-3-030-60440-0_29
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, 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:
Discrete Applied Mathematics. 215:106-111
A non-empty subset S of the vertices of a connected graph G = ( V ( G ) , E ( G ) ) is a safe set if, for every connected component C of G S and every connected component D of G - S , we have | C | ź | D | whenever there exists an edge of G between
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::521d56380ce3f8dd4b5655c500d8bf7d
https://doi.org/10.1016/j.dam.2016.07.020
https://doi.org/10.1016/j.dam.2016.07.020
Let G be a graph, and let w be a positive real-valued weight function on V ( G ) . For every subset S of V ( G ) , let w ( S ) = ∑ v ∈ S w ( v ) . A non-empty subset S ⊂ V ( G ) is a weighted safe set of ( G , w ) if, for every component C of t
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::bc59d7081f0baecd1acee36b070b3a37
http://arxiv.org/abs/1909.02718
http://arxiv.org/abs/1909.02718
Autor:
Yannis Manoussakis, Ravindra B. Bapat, Shinya Fujita, Yasuko Matsui, Zsolt Tuza, Sylvain Legay, Tadashi Sakuma
Publikováno v:
Electronic Notes in Discrete mathematics
Electronic Notes in Discrete mathematics, 2016, Barcelona, Spain. pp.79-84
Electronic Notes in Discrete mathematics, 2016, Barcelona, Spain. pp.79-84
Let G = ( V , E ) be a graph, and w : V → Q > 0 be a positive weight function on the vertices of G. For every subset X of V, let w ( X ) = ∑ v ∈ G w ( v ) . A non-empty subset S ⊂ V ( G ) is a weighted safe set if, for every component C of th
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::ded634add3ceb554ae128156c51180a8
https://doi.org/10.1016/j.endm.2016.09.015
https://doi.org/10.1016/j.endm.2016.09.015
Publikováno v:
Proc. Japan Acad. Ser. A Math. Sci. 95, no. 10 (2019), 111-113
In this paper, we introduce the concept of the Tutte polynomials of genus $g$ and discuss some of its properties. We note that the Tutte polynomials of genus one are well-known Tutte polynomials. The Tutte polynomials are matroid invariants, and we c
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::4b180985ddb14fccebdaeded9b507b51
http://arxiv.org/abs/1810.04878
http://arxiv.org/abs/1810.04878