Zobrazeno 1 - 9
of 9
pro vyhledávání: '"YEN-JEN CHENG"'
Publikováno v:
Mathematics, Vol 10, Iss 15, p 2619 (2022)
We give a family of counterexamples of a theorem on a new upper bound for the α-indices of graphs in the paper that is mentioned in the title. We also provide a new upper bound for corrigendum.
Externí odkaz:
https://doaj.org/article/ed55d01172d14d1496acce76b86ae6f2
Autor:
Yen-Jen Cheng, 鄭硯仁
98
For graphs G_1, G_2, ..., G_r and F, we write F -> (G_1, G_2, ..., G_r)$ to mean that if the edges of F are colored by 1, 2, ..., r then there exists some i such that the edges of color i contains a copy of G_i. The size Ramsey number r(G_1,
For graphs G_1, G_2, ..., G_r and F, we write F -> (G_1, G_2, ..., G_r)$ to mean that if the edges of F are colored by 1, 2, ..., r then there exists some i such that the edges of color i contains a copy of G_i. The size Ramsey number r(G_1,
Externí odkaz:
http://ndltd.ncl.edu.tw/handle/90037993628306039321
Autor:
Yen-Jen Cheng, 鄭嵃仁
95
Fatigue is a part of a wide array of other disorders and problems including poor nutrition and excessive tiredness. Herbal is also believed that it can provide elements to stimulate the cellular function and hence to fight fatigue. There were
Fatigue is a part of a wide array of other disorders and problems including poor nutrition and excessive tiredness. Herbal is also believed that it can provide elements to stimulate the cellular function and hence to fight fatigue. There were
Externí odkaz:
http://ndltd.ncl.edu.tw/handle/04042816899626974520
Publikováno v:
SIAM Journal on Discrete Mathematics; 2024, Vol. 38 Issue 1, p917-946, 30p
For $k\ge 1$, the homogeneous symmetric functions $G(k,m)$ of degree $m$ defined by $\sum_{m\ge 0} G(k,m) z^m=\prod_{i\ge 1} \big(1+x_iz+x^2_iz^2+\cdots+x^{k-1}_iz^{k-1}\big)$ are called \emph{Petrie symmetric functions}. As derived by Grinberg and F
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::1acead64ea84f6135d0deb90e76a3268
The Brauldi-Hoffman conjecture, proved by Rowlinson in 1988, characterized the graph with maximal spectral radius among all simple graphs with prescribed number of edges. In 2008, Bhattacharya, Friedland, and Peled proposed an analog, which will be c
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::525b13df3c65c2038c0b1d53f8ecd910
http://arxiv.org/abs/2112.01124
http://arxiv.org/abs/2112.01124
Motivated by the paper, Boolean lattices: Ramsey properties and embeddings Order, 34 (2) (2017), of Axenovich and Walzer, we study the Ramsey-type problems on the Boolean lattices. Given posets $P$ and $Q$, we look for the smallest Boolean lattice $\
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::5fc67f363b28ea6e5c5c756ada21c318
http://arxiv.org/abs/1909.11370
http://arxiv.org/abs/1909.11370
Publikováno v:
Discrete Mathematics, Algorithms and Applications. 12:2050055
Let [Formula: see text] be a simple undirected graph. [Formula: see text] is a circulant graph defined on [Formula: see text] with difference set [Formula: see text] provided two vertices [Formula: see text] and [Formula: see text] in [Formula: see t
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::ede273a34b36d4db0b16201512e55c08
https://doi.org/10.1142/s179383092050055x
https://doi.org/10.1142/s179383092050055x
Publikováno v:
Taiwanese J. Math. 22, no. 2 (2018), 263-274
In this paper, we study the spectral radius of bipartite graphs. Let $G$ be a bipartite graph with $e$ edges without isolated vertices. It was known that the spectral radius of $G$ is at most the square root of $e$, and the upper bound is attained if
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::93d54d72263d847aadddf6691c7f5d33
http://arxiv.org/abs/1509.07586
http://arxiv.org/abs/1509.07586