Zobrazeno 1 - 10
of 119
pro vyhledávání: '"Yi-Zheng Fan"'
Publikováno v:
Discussiones Mathematicae Graph Theory, Vol 44, Iss 3, p 1107 (2024)
Externí odkaz:
https://doaj.org/article/2d2728917aec464d89e04ea2b4e43876
Publikováno v:
Discrete Mathematics & Theoretical Computer Science, Vol Vol. 10 no. 1, Iss Graph and Algorithms (2008)
Graphs and Algorithms
Externí odkaz:
https://doaj.org/article/f3f1ab9fb18c44be833bd0bf157b17b4
Publikováno v:
Linear Algebra and its Applications. 660:89-117
Let $\mathcal{H}$ be an $m$-uniform hypergraph, and let $\mathcal{A}(\mathcal{H})$ be the adjacency tensor of $\mathcal{H}$ which can be viewed as a system of homogeneous polynomials of degree $m-1$. Morozov and Shakirov generalized the traces of lin
Autor:
Yan-Fang Liu, Zhongxing Jiang, Yafei Li, Yajun Liu, Menglin Li, Tao Li, Chong Wang, Zhenzhen Wu, Mengya Li, Shujuan Wang, Yi zheng Fan, Ruyue Zheng, Yu Zhang
Publikováno v:
OncoTargets and Therapy. 13:12549-12560
Background Relapse is a major obstacle in the treatment of acute myeloid leukemia (AML). Refinement of risk stratification may aid the identification of patients who are likely to relapse. Abnormal cysteine and glycine-rich protein 2 (CSRP2) has b
Publikováno v:
Acta Mathematica Sinica, English Series. 36:1140-1150
The spectral radius of a uniform hypergraph is defined to be that of the adjacency tensor the hypergraph. It is known that the unique unicyclic hypergraph with the largest spectral radius is a nonlinear hypergraph, and the unique linear unicyclic hyp
Publikováno v:
Frontiers of Mathematics in China. 15:451-465
Let $G$ be a connected hypergraph with even uniformity, which contains cut vertices. Then $G$ is the coalescence of two nontrivial connected sub-hypergraphs (called branches) at a cut vertex. Let $\mathcal{A}(G)$ be the adjacency tensor of $G$. The l
Publikováno v:
Linear Algebra and its Applications. 579:244-261
Let G be a connected m-uniform hypergraph. In this paper we mainly consider the eigenvectors of the Laplacian or signless Laplacian tensor of G associated with zero eigenvalue, called the first Laplacian or signless Laplacian eigenvectors of G. By me
Publikováno v:
European Journal of Combinatorics. 80:157-171
Let T = T ( x 0 ) be the Terwilliger algebra of the Johnson scheme J ( N , D ) , where x 0 is a fixed base point. In Liang et al. (2017), an observation is made on the parameters of Leonard systems that arise from the irreducible representations of T
Publikováno v:
Journal of Algebraic Combinatorics. 51:589-616
Using the Poisson formula for resultants, and variants of the chip-firing game on graphs, we provide a combinatorial method for computing a class of resultants corresponding to the characteristic polynomials of the adjacency tensors of starlike hyper
Let G be a connected graph and let T be an acyclic set of edges of G. A partial orientation σ of G with respect to T is an orientation of the edges of G except those edges of T, the resulting graph associated with which is denoted by G T σ . In thi
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::ab5a18b7d3c1ed0734f336c426c80525
http://arxiv.org/abs/2003.08782
http://arxiv.org/abs/2003.08782