| 含有割点的图的最小特征值 |
| |
| 引用本文： | 汪毅,乔云,范益政. 含有割点的图的最小特征值[J]. 数学研究及应用, 2010, 30(6): 951-956. DOI: 10.3770/j.issn:1000-341X.2010.06.001 |
| |
| 作者姓名： | 汪毅 乔云 范益政 |
| |
| 作者单位： | 安徽大学数学科学学院, 安徽 合肥 230039;安徽大学数学科学学院, 安徽 合肥 230039;安徽大学数学科学学院, 安徽 合肥 230039 |
| |
| 基金项目： | 国家自然科学基金(Grant No.11071002), 教育部科学技术研究项目(Grant No.210091), 安徽省优秀青年基金(Grant No.10040606Y33), 安徽大学创新团队计划(Grant No.KJTD001B), 安徽省高校青年教师科研资助项目(Grant No.2008jql021), 安徽省高校优秀青年人才基金(Grant No.2009SQRZ017ZD), 安徽省教育厅自然科学研究项目(Grant No.KJ2010B136). |
| |
| 摘 要： | Let ψ be a certain set of graphs.A graph is called a minimizing graph in the set ψ if its least eigenvalue attains the minimum among all graphs in ψ.In this paper,we determine the unique minimizing graph in ψn,where ψn denotes the set of connected graphs of order n with cut vertices.
|
| 关 键 词： | adjacency matrix least eigenvalue minimizing graph cut vertex. |
| 收稿时间： | 2008-11-09 |
| 修稿时间： | 2009-05-22 |
On the Least Eigenvalue of Graphs with Cut Vertices |
| |
| Yi WANG,Yun QIAO and Yi Zheng FAN. On the Least Eigenvalue of Graphs with Cut Vertices[J]. Journal of Mathematical Research with Applications, 2010, 30(6): 951-956. DOI: 10.3770/j.issn:1000-341X.2010.06.001 |
| |
| Authors: | Yi WANG Yun QIAO Yi Zheng FAN |
| |
| Affiliation: | School of Mathematical Sciences, Anhui University, Anhui 230039, P. R. China |
| |
| Abstract: | Let ${mathscr{S}}$ be a certain set of graphs. A graph is called a minimizing graph in the set ${mathscr{S}}$ if its least eigenvalue attains the minimum among all graphs in ${mathscr{S}}$. In this paper, we determine the unique minimizing graph in ${mathscr {G}}_n$, where ${mathscr {G}}_n$ denotes the set of connected graphs of order $n$ with cut vertices. |
| |
| Keywords: | adjacency matrix least eigenvalue minimizing graph cut vertex. |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
| 点击此处可从《数学研究及应用》浏览原始摘要信息 |
|
点击此处可从《数学研究及应用》下载全文 |
