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

8 papers

math.CO2022

Eigenvalues of signed graphs

Dan Li, Huiqiu Lin, Jixiang Meng

Signed graphs have their edges labeled either as positive or negative. $ρ (M)$ denote the $M$ -spectral radius of $Σ$ , where $M = M (Σ)$ is a real symmetric graph matrix of $Σ$ . Obvious…

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$ …

math.CO2017

Nonseparating trees in 2-connected graphs and oriented trees in strongly connected digraphs

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

Mader [J. Graph Theory 65 (2010) 61-69] conjectured that for every positive integer $k$ and every finite tree $T$ with order $m$ , every $k$ -connected, finite graph $G$ with $δ(G)\g…

math.CO2017★ 1 cited

Connectivity keeping stars or double-stars in 2-connected graphs

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

In [W. Mader, Connectivity keeping paths in $k$ -connected graphs, J. Graph Theory 65 (2010) 61-69.], Mader conjectured that for every positive integer $k$ and every finite tree $T$ …

math.CO2014

Arc-connectivity and super arc-connectivity of mixed Cayley digraph

Yuhu Liu, Jixiang Meng

A digraph X=(V, E) is max-λ, if λ(X)=δ(X). A digraph X is super-λif every minimum cut of X is either the set of inarcs of some vertex or the set of outarcs of some vertex. In this…

math.CO2014

On restricted edge-connectivity of half-transitive multigraphs

Yingzhi Tian, Jixiang Meng, Xing Chen

Let $G = (V, E)$ be a multigraph (it has multiple edges, but no loops). The edge connectivity, denoted by $λ (G)$ , is the cardinality of a minimum edge-cut of $G$ . We call $G$ maximall…