位置：成果数据库 > 期刊 > 期刊详情页
非二部图的最小特征值
  • 期刊名称：安庆师范学院学报(自然科学版)
  • 时间：0
  • 页码：1-3
  • 语言：中文
  • 分类：O157[理学—数学;理学—基础数学]
  • 作者机构：[1]安徽大学数学科学学院,安徽合肥230039
  • 相关基金：国家自然科学基金（10601001）,安徽省自然科学基金（070412065）,安徽省教育厅自然科学研究项目（2005kj005zd）,安徽省学术带头人等科研项目资助.
  • 相关项目：图的Laplace谱理论及其在计算机视觉中的应用
作者： 范益政|
关键词： 图, 非二部图, 邻接矩阵, 最小特征值, Graph, nonbipartite graph, adiacency matrix, least eigenvalue
中文摘要：

设G是一个简单图,其特征值定义为它的邻接矩阵的特征值。在给定阶数的非二部图中,本文确定了最小特征值达到极小的图,并在文末提出一个问题及相关的猜想。

英文摘要：

Let G he a simple graph whose eigenvalues are defined as those of its adjacency matrix. Among all nonbipartite graphs of given order, we determine the graph whose least eigenvalue attains the minimum. We also pose a problem and a related conjecture.

同期刊论文项目
图的Laplace谱理论及其在计算机视觉中的应用
期刊论文 72 会议论文 7 著作 1
同项目期刊论文
Nonsingular mixed graphs with few eigenvalues greater than two
On eigenvectors of mixed graphs with exactly one nonsingular cycle
A Laplacian spectral method for stereo correspondence
有向图的Laplace谱半径
THE SIGNLESS LAPLACIAN SPECTRAL RADIUS OF GRAPHS WITH GIVEN NUMBER OF CUT VERTICES
Maximizing Spectral Radius of Trees with Given Maximal Degree
具有给定割边数的图的无符号Laplace谱半径
The Laplacian spread of bicyclic graphs
匹配数为2的图的最小特征值(英文)
The vertex (edge) independence number, vertex (edge) cover number and the least eigenvalue of a grap
Maximizing signless Laplacian or adjacency spectral radius of graphs subject to fixed connectivity
癌症基因表达数据的熵度量分类方法
On the least eigenvalue of graphs with cut vertices
一种基于修正的最小生成树及其邻接谱的特征匹配算法
The signless Laplacian spectral radius of graph with given number of cut vertices
A NOTE ON THE NORMALIZED LAPLACIAN SPECTRA
The least eigenvalue of a graph with cut vertices
一种基于图理论的非刚体形状匹配算法
SPECTRALLY ARBITRARY COMPLEX SIGN PATTERN MATRICES
基于最小生成树与概率松弛结合的谱匹配算法
The Signless Laplacian Spectral Radius of Graphs with Given Number of Pendant Vertices
The Laplacian spread of unicyclic graphs
On the nullity of bipartite graphs
给定染色数的无符号Laplace谱半径(英文)
一类混合图的结构及其特征空间
基于Laplace谱的图像分类
基于非负矩阵分解与邻接谱的图像分类
一种基于递增权值函数的图像谱的匹配算法
一种结合形状上下文分析的Laplace谱匹配算法
基于最小生成树的LAPLACE谱图像匹配算法
一种使用TPS变形模型的Laplace谱匹配算法
单圈混合图的极大谱半径(英文)
Spectral property of certain class of graphs associated with generalized Bethe trees and transitive
Order unicyclic graphs according to spectral radius of unoriented Laplacian matrix
An upper bound on the Laplacian spectral radius of the signed graphs
Maximizing spectral radius of unoriented Laplacian matrix over bicyclic graphs of a given order
The Laplacian spread of a tree
Unoriented Laplacian maximizing graphs are degree maximal
The effect on the second smallest eigenvalue of the normalized Laplacian of a graph by grafting edge
On edge singularity and eigenvectors of mixed graphs
Nonsingular unicyclic mixed graph with at most three eigenvalues greater than two
On the second largest eigenvalue of a mixed graph
Order unicyclic mixed graph by spectral radius
On graphs with three distinct Laplacian eigenvalues
一种半监督流形学习的人脸识别方法
图的谱半径与拟悬挂点数
结合测地线-灰度直方图的谱匹配算法
ON GRAPHS WITH THREE DISTINCT LAPLACIAN EIGENVALUES
给定染色数的无符号Laplace谱半径
单圈混合图的极大谱半径
Maximizing Spectral Radius of Trees with Given Maximal Degree
匹配数为2的图的最小特征值