首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   1篇
  免费   0篇
  国内免费   3篇
数学   4篇
  2021年   1篇
  2020年   1篇
  2018年   1篇
  2014年   1篇
排序方式: 共有4条查询结果,搜索用时 0 毫秒
1
1.
Let G be a simple graph. We first show that ■, where δiand di denote the i-th signless Laplacian eigenvalue and the i-th degree of vertex in G, respectively.Suppose G is a simple and connected graph, then some inequalities on the distance signless Laplacian eigenvalues are obtained by deleting some vertices and some edges from G. In addition, for the distance signless Laplacian spectral radius ρQ(G), we determine the extremal graphs with the minimum ρQ(G) among the trees with given diameter, the unicyclic and bicyclic graphs with given girth, respectively.  相似文献   
2.
A mixed graph means a graph containing both oriented edges and undirected edges. The nullity of the Hermitian-adjacency matrix of a mixed graph G, denoted by ηH(G),is referred to as the multiplicity of the eigenvalue zero. In this paper, for a mixed unicyclic graph G with given order and matching number, we give a formula on ηH(G), which combines the cases of undirected and oriented unicyclic graphs and also corrects an error in Theorem 4.2 of [Xueliang LI, Guihai YU. The skew-rank of oriented graphs. Sci. Sin. Math., 2015, 45:93-104(in Chinese)]. In addition, we characterize all the n-vertex mixed graphs with nullity n-3, which are determined by the spectrum of their Hermitian-adjacency matrices.  相似文献   
3.
符号图是边赋值为±1的一类图.设符号图Γ的拉普拉斯矩阵为L(Γ)=D(G)-A(Γ),这里D(G)表示度矩阵, A(Γ)表示符号图的邻接矩阵.Γ是平衡的当且仅当最小拉普拉斯特征值λn=0.因此当Γ非平衡时λn>0.本文研究了非平衡符号图的最小拉普拉斯特征值问题.利用图特征值的嫁接方法,获得了给定悬挂点非平衡符号图的最小拉普拉斯特征值,并且刻画了达到最小特征值的极图.  相似文献   
4.
设$\mathbb{T}$是模为1的复数乘法子群.图$G=(V,E)$,这里$V,E$分别表示图的点和边.增益图是将底图中的每条边赋于$\mathbb{T}$中的某个数值$\varphi(v_iv_j)$,且满足$\varphi(v_iv_j) =\overline{\varphi(v_jv_i)}$.将赋值以后的增益图表示为$(G,\varphi)$.设$i_+(G,\varphi)$和$i_+(G)$分别表示增益图与底图的正惯性指数,本文证明了如下结论: $$ - c( G ) \le {i_ + } ( {G,\varphi } ) - {i_ + }( G ) \le c( G ), $$ 这里$c(G)$表示圈空间维数,并且刻画了等号成立时候的所有极图.  相似文献   
1
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号