Zobrazeno 1 - 10
of 38
pro vyhledávání: '"Chih-wen Weng"'
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:
Chih-wen Weng, Louis Kao
Publikováno v:
Applied Mathematical Sciences. 15:553-557
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::56d9192c8d026fd256551212ef8fc2f6
https://doi.org/10.12988/ams.2021.914558
https://doi.org/10.12988/ams.2021.914558
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
Autor:
Chih-wen Weng, Louis Kao
The relation between Hamiltonicity and toughness of a graph is a long standing research problem. The paper studies the Hamiltonicity of the Cartesian product graph $$G_1\square G_2$$ of graphs $$G_1$$ and $$G_2$$ satisfying that $$G_1$$ is traceable
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::1543c43ab00b877a5636c3d8f4c27b38
http://arxiv.org/abs/2003.03084
http://arxiv.org/abs/2003.03084
Autor:
Chih-wen Weng, Chia An Liu
Publikováno v:
Linear Algebra and its Applications. 474:30-43
Let k, p, q be positive integers with k p q + 1 . We prove that the maximum spectral radius of a simple bipartite graph obtained from the complete bipartite graph K p , q of bipartition orders p and q by deleting k edges is attained when the deleted
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::b6f17316afa27d79a9cfcd1a858ad22e
https://doi.org/10.1016/j.laa.2015.01.040
https://doi.org/10.1016/j.laa.2015.01.040
Publikováno v:
Discrete Mathematics. 320:64-72
In Huang and Weng (2004), Huang and Weng introduced pooling spaces, and constructed pooling designs from a pooling space. In this paper, we introduce the concept of pooling semilattices and prove that a pooling semilattice is a pooling space, then sh
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::8d6103505df61cb51d6a4528b037aff5
https://doi.org/10.1016/j.disc.2013.12.004
https://doi.org/10.1016/j.disc.2013.12.004
Autor:
Chih-wen Weng, Guang Siang Lee
Publikováno v:
Linear Algebra and its Applications. 446:91-103
It is well-known that the halved graphs of a bipartite distance-regular graph are distance-regular. Examples are given to show that the converse does not hold. Thus, a natural question is to find out when the converse is true. In this paper we give a
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::bdf1b541b4f1bbbac1e6a666b343b399
https://doi.org/10.1016/j.laa.2013.12.024
https://doi.org/10.1016/j.laa.2013.12.024
Autor:
Chih-wen Weng, Chia-an Liu
It is not hard to find many complete bipartite graphs which are not determined by their spectra. We show that the graph obtained by deleting an edge from a complete bipartite graph is determined by its spectrum. We provide some graphs, each of which
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::b13987e8055ff0937ab82346ae668407
http://arxiv.org/abs/1601.07012
http://arxiv.org/abs/1601.07012
Autor:
Guang-Siang Lee, Chih-wen Weng
Publikováno v:
Journal of Combinatorial Theory, Series A. 119:1427-1431
The spectral excess theorem asserts that the average excess is, at most, the spectral excess in a regular graph, and equality holds if and only if the graph is distance-regular. An example demonstrates that this theorem cannot directly apply to nonre
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::cc677cddb881f00bbc91378de090e122
https://doi.org/10.1016/j.jcta.2012.04.002
https://doi.org/10.1016/j.jcta.2012.04.002
Autor:
Chih-wen Weng, Yeh-jong Pan
Publikováno v:
Journal of Combinatorial Theory, Series B. 99:266-270
Let @C denote a distance-regular graph with classical parameters (D,b,@a,@b) and D>=3. Assume the intersection numbers a"1=0 and a"2 0. We show that the intersection number c"2 is either 1 or 2, and if c"2=1, then (b,@a,@b)=(-2,-2,((-2)^D^+^1-1)/3).
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::42c6fe7e981238f9459058e6e0e8a66d
https://doi.org/10.1016/j.jctb.2008.07.005
https://doi.org/10.1016/j.jctb.2008.07.005