Jixiang Meng

activity

20142022

most citedThe

A_{α}

-spectral radius of graphs with given degree sequence

1 citations · 2 across the 8 of their papers we have counts for

collaborators

Showing 2018Show all

3 papers · 1 filter

math.CO2018★ 1 cited

The $A_{α}$ -spectral radius of graphs with given degree sequence

Dan Li, Yuanyuan Chen, Jixiang Meng

Let $G$ be a graph with adjacency matrix $A (G)$ , and let $D (G)$ be the diagonal matrix of the degrees of $G$ . For any real $α \in [0, 1]$ , write $A_{α} (G)$ for the matrix $$A_α(G)=αD(G)…

math.CO2018

On the sizes of $(k, l)$ -edge-maximal $r$ -uniform hypergraphs

Yingzhi Tian, Hong-Jian Lai, Jixiang Meng +1

Let $H = (V, E)$ be a hypergraph, where $V$ is a set of vertices and $E$ is a set of non-empty subsets of $V$ called edges. If all edges of $H$ have the same cardinality $r$ , then $H$ …

math.CO2018

On the sizes of $k$ -edge-maximal $r$ -uniform hypergraphs

Yingzhi Tian, Liqiong Xu, Hong-Jian Lai +1

Let $H = (V, E)$ be a hypergraph, where $V$ is a set of vertices and $E$ is a set of non-empty subsets of $V$ called edges. If all edges of $H$ have the same cardinality $r$ , then $H$ …

The Aα​-spectral radius of graphs with given degree sequence

On the sizes of (k,l)-edge-maximal r-uniform hypergraphs

On the sizes of k-edge-maximal r-uniform hypergraphs

The $A_{α}$ -spectral radius of graphs with given degree sequence

On the sizes of $(k, l)$ -edge-maximal $r$ -uniform hypergraphs

On the sizes of $k$ -edge-maximal $r$ -uniform hypergraphs