Zobrazeno 1 - 10
of 2 939
pro vyhledávání: '"Zhang Xiao-dong"'
Autor:
Xu, Yue, Zhang, Xiao-Dong
A balanced 2-partition of a graph is a bipartition $A,A^c$ of $V(G)$ such that $|A|=|A^c|$. Balogh, Clemen, and Lidick\'y conjectured that for every $K_4$-free graph on $n$ (even) vertices, there exists a balanced 2-partition $A,A^c$ such that $\max\
Externí odkaz:
http://arxiv.org/abs/2412.13485
Autor:
Li, Xuetong, Zhang, Xiao-Dong
Multisource data has spurred the development of advanced clustering algorithms, such as multi-view clustering, which critically relies on constructing similarity matrices. Traditional algorithms typically generate these matrices from sample attribute
Externí odkaz:
http://arxiv.org/abs/2410.21711
Autor:
Hu, Qitong, Zhang, Xiao-Dong
Key network motifs searching in complex networks is one of the crucial aspects of network analysis. There has been a series of insightful findings and valuable applications for various scenarios through the analysis of network structures. However, in
Externí odkaz:
http://arxiv.org/abs/2408.08932
Autor:
Zhao, Kai, Zhang, Xiao-Dong
This paper focuses on extensions of the classic Erd\H{o}s-Gallai Theorem for the set of weighted function of each edge in a graph. The weighted function of an edge $e$ of an $n$-vertex uniform hypergraph $\mathcal{H}$ is defined to a special function
Externí odkaz:
http://arxiv.org/abs/2404.00873
We proposed two classes of multiparticle entangled states, the multigraph states and multihypergraph states, defined by unique operations on the edges and hyperedges. A key discovery is the one-to-one correspondence between the proposed multihypergra
Externí odkaz:
http://arxiv.org/abs/2312.14399
In this paper, we present a sharp upper bound for the spectral radius of an $n$-vertex graph without $F$-minor for sufficient large $n$, where $F$ is obtained from the complete graph $K_r$ by deleting disjointed paths. Furthermore, the graphs which a
Externí odkaz:
http://arxiv.org/abs/2311.06833
Autor:
Wang, Yuzhenni, Zhang, Xiao-Dong
Publikováno v:
Discrete Applied Mathematics, 2023
Let $G$ be an simple graph of order $n$ whose adjacency eigenvalues are $\lambda_1\ge\dots\ge\lambda_n$. The HL--index of $G$ is defined to be $R(G)= \max\{|\lambda_{h}|, |\lambda_{l}|\}$ with $h=\left\lfloor\frac{n+1}{2}\right\rfloor$ and $ l=\left\
Externí odkaz:
http://arxiv.org/abs/2311.01884
Autor:
Hu, Qitong, Zhang, Xiao-Dong
Various disasters stem from minor perturbations, such as the spread of infectious diseases, cascading failure in power grids, etc. Analyzing perturbations is crucial for both theoretical and application fields. Previous researchers have proposed basi
Externí odkaz:
http://arxiv.org/abs/2310.04989
Stanley introduced the concept of chromatic symmetric functions of graphs which extends and refines the notion of chromatic polynomials of graphs, and asked whether trees are determined up to isomorphism by their chromatic symmetric functions. Using
Externí odkaz:
http://arxiv.org/abs/2308.03980