期刊文献+
共找到4篇文章
< 1 >
每页显示 20 50 100
Quadratic Starlike Trees
1
作者 Yarong Hu qiongxiang huang 《Algebra Colloquium》 SCIE CSCD 2023年第4期615-638,共24页
We introduce the notion of a quadratic graph,which is a graph whose eigenvalues are integral or quadratic algebraic integral,and we determine nine infinite families of quadratic starlike trees,which are just all the q... We introduce the notion of a quadratic graph,which is a graph whose eigenvalues are integral or quadratic algebraic integral,and we determine nine infinite families of quadratic starlike trees,which are just all the quadratic starlike trees including integral starlike trees.Thus,the quadratic starlike trees are completely characterized.The expressions for characteristic polynomials of quadratic starlike trees are also given. 展开更多
关键词 quadratic algebraic integer starlike tree characteristic polynomial
原文传递
On Graphs with Three or Four Distinct Normalized Laplacian Eigenvalues 被引量:1
2
作者 Xueyi huang qiongxiang huang 《Algebra Colloquium》 SCIE CSCD 2019年第1期65-82,共18页
We characterize all connected graphs with exactly three distinct normalized Laplacian eigenvalues among which one is equal to 1, and determine all connected bipartite graphs with at least one vertex of degree 1 having... We characterize all connected graphs with exactly three distinct normalized Laplacian eigenvalues among which one is equal to 1, and determine all connected bipartite graphs with at least one vertex of degree 1 having exactly four distinct normalized Laplacian eigenvalues. In addition, we find all unicyclic graphs with three or four distinct normalized Laplacian eigenvalues. 展开更多
关键词 normalized LAPLACIAN eigenvalue BIPARTITE GRAPH symmetrie BIBD unicyclic GRAPH HADAMARD matrix
原文传递
The Spectrum and Automorphism Group of the Set-Inclusion Graph
3
作者 Xueyi huang qiongxiang huang Jianfeng Wang 《Algebra Colloquium》 SCIE CSCD 2021年第3期497-506,共10页
Let n,k and l be integers with 1≤k<l≤n-1.The set-inclusion graph G(n,k,l)is the graph whose vertex set consists of all κ-and l-subsets of[n]={1,2,...,n},where two distinct vertices are adjacent if one of them is... Let n,k and l be integers with 1≤k<l≤n-1.The set-inclusion graph G(n,k,l)is the graph whose vertex set consists of all κ-and l-subsets of[n]={1,2,...,n},where two distinct vertices are adjacent if one of them is contained in the other.In this paper,we determine the spectrum and automorphism group of G(n,k,l). 展开更多
关键词 set-inclusion graph SPECTRUM automorphism group
原文传递
Automorphism Groups of a Class of Cubic Cayley Graphs on Symmetric Groups
4
作者 Xueyi huang qiongxiang huang Lu Lu 《Algebra Colloquium》 SCIE CSCD 2017年第4期541-550,共10页
Let Sn denote the symmetric group of degree n with n 〉 3, S = {cn = (1 2…n), cn^-1, (1 2)} and Fn=Cay(Sn, S) be the Cayley graph on Sn with respect to S. In this paper, we show that Fn (n 〉 13) is a normal ... Let Sn denote the symmetric group of degree n with n 〉 3, S = {cn = (1 2…n), cn^-1, (1 2)} and Fn=Cay(Sn, S) be the Cayley graph on Sn with respect to S. In this paper, we show that Fn (n 〉 13) is a normal Cayley graph, and that the full automorphism group of Fn is equal to Aut(Гn) = R(Sn) (Inn(C))≌- Sn×Z2, where R(Sn) is the right regular representation of Sn,φ = (1 2)(3 n)(4 n-1)(5 n-2)... (∈ Sn), and Inn(C) is the inner isomorphism of Sn induced by φ . 展开更多
关键词 Cayley graph NORMAL automorphism group
原文传递
上一页 1 下一页 到第
使用帮助 返回顶部