Zobrazeno 1 - 10
of 166
pro vyhledávání: '"Yoshio Sano"'
Publikováno v:
Journal of Plant Interactions, Vol 13, Iss 1, Pp 442-449 (2018)
Breeding of competitive cultivars has long been fraught with difficulty owing to limited knowledge of the genetic basis of competitive ability. In this study, we examined the diversity of competitive ability in Asian rice and the genetic basis of thi
Externí odkaz:
https://doaj.org/article/902a74ce40504adfb1fed797de88ab33
Autor:
Yoshio Sano, Jeongmi Park
Publikováno v:
Discrete Mathematics & Theoretical Computer Science, Vol Vol. 17 no.2, Iss Graph Theory (2015)
In this article, we introduce the notion of the double competition multigraph of a digraph. We give characterizations of the double competition multigraphs of arbitrary digraphs, loopless digraphs, reflexive digraphs, and acyclic digraphs in terms of
Externí odkaz:
https://doaj.org/article/0b2d764b8051467aacc8f900bd8f5645
Publikováno v:
Plant Production Science, Vol 6, Iss 3, Pp 179-184 (2003)
The architecture of a grass population is determined by the spatial distribution and morphology of tillers. The demographic and phase changes of tillers were compared between an annual-like (Progrow) and perennial (Ruanui) lines of Loliumspecies. We
Externí odkaz:
https://doaj.org/article/c825104b77e442619fb63533006cea1e
Autor:
Boram Park, Yoshio Sano
Publikováno v:
Discrete Mathematics & Theoretical Computer Science, Vol Vol. 14 no. 2, Iss Graph Theory (2012)
Graph Theory
Externí odkaz:
https://doaj.org/article/b1da57b6adc44d39850e094bc3325f96
Publikováno v:
Linear Algebra and its Applications. 654:267-288
Autor:
Ping Zhan, Yoshio Sano
Publikováno v:
Operations Research Forum. 2
For the problem of allocating indivisible goods to agents, we recently generalized the probabilistic serial (PS) mechanism proposed by Bogomolnaia and Moulin (J Econ Theory 100(2):295–328, 2001). We generalized the constraints with the fixed quota
Publikováno v:
Theoretical Computer Science. 791:1-9
In this paper, we introduce a new family of graphs which is a subclass of chordal graphs as well as a superclass of interval graphs and study it. Myung [8] proposed an algorithm for the minimum clique partitioning problem with constrained bounds in w
Autor:
Yoshio Sano, Jongyook Park
Publikováno v:
Linear Algebra and its Applications. 577:384-411
Q-integral graphs are graphs whose signless Laplacians have only integral eigenvalues. The edge-degree of an edge is the number of edges adjacent to the edge. In 2008, S. K. Simic and Z. Stanic studied connected Q-integral graphs with edge-degrees at
Publikováno v:
Discrete Applied Mathematics. 254:47-55
Choi et al. (2016) introduced the notion of the partial order competition dimension of a graph and characterized the graphs with partial order competition dimension d in terms of homothetic regular ( d − 1 ) -simplices in R d which are contained in
In this paper, we show that every connected signed graph with smallest eigenvalue strictly greater than $-2$ and large enough minimum degree is switching equivalent to a complete graph. This is a signed analogue of a theorem of Hoffman. The proof is
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::c1f169903d3851bce0895f0a0d879f92