1 citations · 1 across the 3 of their papers we have counts for
6 papers
Eigenvalues of signed graphs
Dan Li, Huiqiu Lin, Jixiang Meng
Signed graphs have their edges labeled either as positive or negative. denote the -spectral radius of , where is a real symmetric graph matrix of . Obvious…
The -spectral radius of graphs with given degree sequence
Dan Li, Yuanyuan Chen, Jixiang Meng
Let be a graph with adjacency matrix , and let be the diagonal matrix of the degrees of . For any real , write for the matrix $$A_α(G)=αD(G)…
On the sizes of -edge-maximal -uniform hypergraphs
Yingzhi Tian, Hong-Jian Lai, Jixiang Meng +1
Let be a hypergraph, where is a set of vertices and is a set of non-empty subsets of called edges. If all edges of have the same cardinality , then …
On the sizes of -edge-maximal -uniform hypergraphs
Yingzhi Tian, Liqiong Xu, Hong-Jian Lai +1
Let be a hypergraph, where is a set of vertices and is a set of non-empty subsets of called edges. If all edges of have the same cardinality , then …
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 and every finite tree with order , every -connected, finite graph with $δ(G)\g…
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 -connected graphs, J. Graph Theory 65 (2010) 61-69.], Mader conjectured that for every positive integer and every finite tree …