Zobrazeno 1 - 10
of 33
pro vyhledávání: '"David G. L. Wang"'
Autor:
David G. L. Wang, Monica M. Y. Wang
Publikováno v:
Journal of Algebraic Combinatorics. 57:495-514
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::0ead34f7e69e9fde2c87b8c3e70d333e
https://doi.org/10.1007/s10801-022-01175-6
https://doi.org/10.1007/s10801-022-01175-6
Publikováno v:
Journal of Combinatorial Optimization. 43:460-496
It is known that the problem of computing the edge dimension of a graph is NP-hard, and that the edge dimension of any generalized Petersen graph P(n, k) is at least 3. We prove that the graph P(n, 3) has edge dimension 4 for $$n\ge 11$$ , by showing
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::334918e500b44908208af5c475eaf0f3
https://doi.org/10.1007/s10878-021-00780-8
https://doi.org/10.1007/s10878-021-00780-8
Publikováno v:
The Ramanujan Journal. 58:203-228
The alternating descent statistic on permutations was introduced by Chebikin as a variant of the descent statistic. We show that the alternating descent polynomials on permutations, called alternating Eulerian polynomials, are unimodal via a five-ter
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::9ad8ff37491eca24bf18ceedf80cb756
https://doi.org/10.1007/s11139-021-00460-5
https://doi.org/10.1007/s11139-021-00460-5
Autor:
David G. L. Wang, Monica M. Y. Wang
Publikováno v:
Discrete Applied Mathematics. 285:621-630
We provide a formula for every Schur coefficient in the chromatic symmetric function of a graph in terms of special rim hook tabloids. This formula is useful in confirming the non-Schur positivity of the chromatic symmetric function of a graph, espec
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::01ef9157a0117317f3f2d5debe07bffd
https://doi.org/10.1016/j.dam.2020.07.005
https://doi.org/10.1016/j.dam.2020.07.005
Autor:
David G. L. Wang, Jerry J. R. Zhang
Publikováno v:
Bulletin of the Malaysian Mathematical Sciences Society. 44:785-803
In this paper, we study the root distribution of some univariate polynomials satisfying a recurrence of order two with linear polynomial coefficients. We show that the set of non-isolated limits of zeros of the polynomials is either an arc, or a circ
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::8439bc19ddb395eac0cc3fa364ae6e7e
https://doi.org/10.1007/s40840-020-00975-y
https://doi.org/10.1007/s40840-020-00975-y
Autor:
David G. L. Wang, Dannielle D.D. Jin
Publikováno v:
Discrete Applied Mathematics. 266:309-318
It is known that any vertex cover of the generalized Petersen graph P ( n , k ) has size at least n . Behsaz, Hatami and Mahmoodian characterized such graphs with minimum vertex cover numbers n and n + 1 , and those with k ≤ 3 . For k ≥ 4 and n
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::3c99d3702852f5f869b690755a2422b6
https://doi.org/10.1016/j.dam.2018.12.011
https://doi.org/10.1016/j.dam.2018.12.011
Motivated by Stanley's $\mathbf{(3+1)}$-free conjecture on chromatic symmetric functions, Foley, Ho\`{a}ng and Merkel introduced the concept of strong $e$-positivity and conjectured that a graph is strongly $e$-positive if and only if it is (claw, ne
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::8b81672c2bca8afaecaf53f4d885d683
http://arxiv.org/abs/2010.14312
http://arxiv.org/abs/2010.14312
Autor:
Jerry J. R. Zhang, David G. L. Wang
We give a new semi-combinatorial proof for the equality of the number of ballot permutations of length $n$ and the number of odd order permutations of length $n$, which is due to Bernardi, Duplantier and Nadeau. Spiro conjectures that the descent num
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::a40a5bed4ca234af5b4056f432310c43
Autor:
Hongliang Lu, David G. L. Wang
Publikováno v:
Applicable Analysis and Discrete Mathematics. 11:11-38
We obtain a sharp result that for any even n ? 34, every {Dn,Dn+1}-regular graph of order n contains ?n/4? disjoint perfect matchings, where Dn = 2?n/4?-1. As a consequence, for any integer D ? Dn, every {D, D+1}- regular graph of order n contains (D
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::1df2bc0ae388190cd2b0133561ed24bb
https://doi.org/10.2298/aadm161109030l
https://doi.org/10.2298/aadm161109030l
Publikováno v:
Mathematical Inequalities & Applications. :91-103
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::6e718e7fbc542f683cd8a36e9059cfe2
https://doi.org/10.7153/mia-20-06
https://doi.org/10.7153/mia-20-06