Zobrazeno 1 - 10
of 343
pro vyhledávání: '"Sano Yoshio"'
Autor:
Sano Yoshio
Publikováno v:
Discussiones Mathematicae Graph Theory, Vol 35, Iss 3, Pp 595-598 (2015)
In this note, we give an easy and short proof for the theorem by Park and Kim stating that the hypercompetition numbers of hypergraphs with maximum degree at most two is at most two.
Externí odkaz:
https://doaj.org/article/cfedbd864ecd44b6acd8f72e680776db
Autor:
Park Jeongmi, Sano Yoshio
Publikováno v:
Discussiones Mathematicae Graph Theory, Vol 34, Iss 2, Pp 353-359 (2014)
The niche graph of a digraph D is the (simple undirected) graph which has the same vertex set as D and has an edge between two distinct vertices x and y if and only if N+D(x) ∩ N+D(y) ≠ ∅ or N−D(x) ∩ N−D(y) ≠ ∅, where N+D(x) (resp. N
Externí odkaz:
https://doaj.org/article/95160774610e4517a72ec4a5b074dc00
Autor:
Park Boram, Sano Yoshio
Publikováno v:
Discussiones Mathematicae Graph Theory, Vol 33, Iss 4, Pp 657-664 (2013)
The competition graph of a doubly partial order is known to be an interval graph. The CCE graph and the niche graph of a doubly partial order are also known to be interval graphs if the graphs do not contain a cycle of length four and three as an ind
Externí odkaz:
https://doaj.org/article/3857144c81be4a9e8eb1d5197753f220
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:
http://arxiv.org/abs/2003.05578
Publikováno v:
BMC Genomics, Vol 8, Iss 1, p 469 (2007)
Abstract Background Recent studies using high-throughput methods have revealed that transposable elements (TEs) are a comprehensive target for DNA methylation. However, the relationship between TEs and their genomic environment regarding methylation
Externí odkaz:
https://doaj.org/article/fd346baf5720486cbffc960f145ebb36
Publikováno v:
BMC Genomics, Vol 5, Iss 1, p 80 (2004)
Abstract Background Plant genomes contain various kinds of repetitive sequences such as transposable elements, microsatellites, tandem repeats and virus-like sequences. Most of them, with the exception of virus-like sequences, do not allow us to trac
Externí odkaz:
https://doaj.org/article/06e5cb773468483c9b5a4b27b8139abf
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Publikováno v:
In Linear Algebra and Its Applications 1 December 2022 654:267-288
Hefner [K. A. S. Hefner, K. F. Jones, S. -R. Kim, R. J. Lundgren and F. S. Roberts: $(i,j)$ competition graphs, Discrete Applied Mathematics, 32, (1991) 241-262] characterized acyclic digraphs each vertex of which has inderee and outdegree at most tw
Externí odkaz:
http://arxiv.org/abs/1611.00246
Choi {\it et al.} [{J.~Choi, K.~S.~Kim, S.~-R.~Kim, J.~Y.~Lee, and Y.~Sano}: {On the competition graphs of $d$-partial orders}, \emph{Discrete Applied Mathematics} (2015), \texttt{http://dx.doi.org/10.1016/j.dam.2015.11.004}] introduced the notion of
Externí odkaz:
http://arxiv.org/abs/1601.01188