国家自然科学基金(11071002)

作品数：17被引量：65H指数：4
导出分析报告
相关作者：范益政余桂东李小新朱明梁栋更多>>
相关机构：安徽大学安庆师范学院池州学院安徽科技学院更多>>
相关期刊：《应用数学》《华东理工大学学报（自然科学版）》《数学杂志》《中国科学技术大学学报》更多>>
相关主题：英文GRAPH谱半径GRAPHSEIGENVALUE更多>>
相关领域：理学自动化与计算机技术更多>>
-
在结果中检索

检索结果分析

结果分析中...
共 条 记 录，以下是1-10
全选清除导出
参考文献引证文献引用追踪
视图：
排序：
图的哈密尔顿性的谱条件(英文)被引量：5
《应用数学》2014年第3期588-595,共8页余桂东 
Supported by the National Natural Science Foundation of China(11071002);the NFS of Anhui Province(11040606M14);the NSF of Department of Education of Anhui Province(KJ2011A195);the Program for New Century Excellent Talents in University(NCET-10-0001);the Key Project of Chinese Ministry of Education(210091);the Specialized Research Fund for the Doctoral Program of Higher Education(20103401110002);the Scientific Research Fund for Fostering Distinguished Young Scholars of Anhui University(KJJQ1001)
本文,我们利用补图的邻接矩阵的谱半径给出原图含有哈密尔顿路,哈密尔顿圈,以及原图是哈密尔顿-连通图的一些谱条件.
关键词：图 谱半径 哈密尔顿路 哈密尔顿圈 哈密尔顿-连通图 
给定边连通度的图的最小距离谱半径(英文)被引量：1
《数学杂志》2014年第4期671-678,共8页李小新 范益政 汪毅 
Supported by National Natural Science Foundation of China(11071002);Program for New Century Excellent Talents in University;Key Project of Chinese Ministry of Education(210091);Natural Science Research Foundation of Department of Education of Anhui Province(KJ2013A196)
本文研究了边连通度为r的n阶连通图中距离谱半径最小的极图问题,利用组合的方法,确定了K(n-1,r)为唯一的极图,其中K(n-1,r)是由完全图K_(n-1)添加一个顶点v以及连接v与K_(n-1)中r个顶点的边所构成.上述结论推广了极图理论中的相关结果.
关键词：图 距离矩阵 谱半径 边连通度 
图的能量与哈密尔顿性
《运筹学学报》2014年第2期40-48,共9页余桂东 张超 龚奇娟 
国家自然科学基金(No.11071002);安徽省自然科学基金(No.11040606M14);安徽省高校自然科学基金(Nos.KJ2011A195;KJ2013A196);安庆师范学院青年科学研究基金(No.KJ201307)
设G是一个无向简单图,A(G)为G的邻接矩阵.用G的补图的特征值给出G包含哈密尔顿路、哈密尔顿圈以及哈密尔顿连通图的充分条件;其次用二部图的拟补图的特征值给出二部图包含哈密尔顿圈的充分条件.这些结果改进了一些已知的结果.
关键词：图的能量 哈密尔顿路 哈密尔顿圈 哈密尔顿连通图 
Some notes on the spectral perturbations of the signless Laplacian of a graph被引量：1
《Applied Mathematics(A Journal of Chinese Universities)》2014年第2期241-248,共8页YU Gui-dong CAI Gai-xiang FAN Yi-zheng 
Supported by the National Natural Science Foundation of China(11071002);the Anhui Natural ScienceFoundation of China(11040606M14);NSF of Department of Education of Anhui Province(KJ2011A195)
Let G be a simple graph and let Q（G） be the signless Laplacian matrix of G. In this paper we obtain some results on the spectral perturbation of the matrix Q（G） under an edge addition or an edge contraction.
关键词：GRAPH signless Laplacian matrix spectral perturbation. 
具有n-3个悬挂点的树的距离无符号拉普拉斯谱半径(英文)被引量：1
《中国科学技术大学学报》2014年第3期176-180,共5页余桂东 龚奇娟 段兰 
Supported by National Natural Science Foundation of China(11071002);NFS of Anhui Province(11040606M14);NSF of Department of Education of Anhui Province(KJ2011A195,KJ2010B136)
一个连通图G的距离无符号拉普拉斯谱半径是G的距离无符号拉普拉斯矩阵的谱半径.G的距离无符号拉普拉斯矩阵定义为Q(G)=Tr(G)+D(G),这里Tr(G)是G的顶点传递的对角阵,且D(G)是G的距离矩阵.研究了所有n阶具有n-3个悬挂点的树的距离无符号...
关键词：图 树 距离无符号拉普拉斯矩阵 距离无符号拉普拉斯谱半径 
连通图的Harary指数上界及其极图被引量：3
《中国科学技术大学学报》2014年第2期96-100,共5页李小新 查淑萍 范益政 
国家自然科学基金(11071002);安徽省教育厅自然科学研究重点项目(KJ2013A196)资助
图的Harary指数定义为图的所有顶点对的距离的倒数之和.刻画了在给定点数和直径的图类中,Harary指数达到最大的极图,并由此确定了Harary指数关于直径的一个上界.另外,在n阶连通图中,刻画了Harary指数达到第二大和第三大的图的结构.
关键词：图 Harary指数 直径 
仙人掌图的Wiener极化指数(英文)被引量：3
《应用数学》2013年第4期798-802,共5页陈楠 杜文学 范益政 
Supported by the National Natural Science Foundation of China(11071002,11126178);the Program for New Century Excellent Talents in University(NCET-10-0001);the Key Project of Chinese Ministry of Education(210091);the Specialized Research Fund for the Doctoral Program of Higher Education(20103401110002);the Science and Technological Fund of Anhui Province for Outstanding Youth(10040606Y33);the Project of Educational Department of Anhui Province (KJ2011A019);the Scientic Research Fund for Fostering Distinguished Young Scholars of Anhui University(KJJQ1001);the Academic Innovation Team of Anhui University Project(KJTD001B)
图的Wiener极化指数定义为图中距离为3的无序点对的数目.本文给出仙人掌图的Wiener极化指数的显示表示,并导出若干特殊仙人掌图的极化指数公式.
关键词：-Wiener极化指数 距离 仙人掌图 
补图为2-点或2-边连通的图的最小特征值(英文)被引量：8
《运筹学学报》2013年第2期81-88,共8页余桂东 范益政 
Supported by National Natural Science Foundation of China(No.11071002);Program for New Century Excellent Talents in University,Key Project of Chinese Ministry of Education(No.210091);Specialized Research Fund for the Doctoral Program of Higher Education(No.20103401110002);Science and Technological Fund of Anhui Province for Outstanding Youth(No.10040606Y33);National Science Foundation of the Department of Education of Anhui Province(Nos.KJ2011A195,KJ2010B136);Scientific Research Fund for Fostering Distinguished Young Scholars of Anhui University(No.KJJQ1001);Project for Academic Innovation Team of Anhui University(No.KJTD001B)
图的最小特征值定义为图的邻接矩阵的最小特征值,是刻画图结构性质的一个重要代数参数.在所有给定阶数的补图为2-点或2-边连通的图中,刻画了最小特征值达到极小的唯一图,并给出了这类图最小特征值的下界.
关键词：图 2-点连通 2-边连通 邻接矩阵 最小特征值 
最大化小维数图的补的谱半径的统一方法(英文)
《应用数学》2013年第1期182-189,共8页李小新 范益政 杨行君 汪毅 
Supported by the National Natural Science Foundation of China(11071002);the Program for New Century Excellent Talents in University,the Key Project of Chinese Ministry of Education(210091);the Specialized Research Fund for the Doctoral Program of Higher Education(20103401110002)
在树、单圈图、双圈图和三圈图的补图中,本文给出了统一的方法来刻画具有极大谱半径的图.
关键词：谱半径 补图 单圈图 双圈图 三圈图 
The Least Eigenvalue of Graphs被引量：7
《Journal of Mathematical Research with Applications》2012年第6期659-665,共7页Guidong YU Yizheng FAN Yi WANG 
Supported by National Natural Science Foundation of China (Grant No. 11071002);Program for New Century Excellent Talents in University, Key Project of Chinese Ministry of Education (Grant No. 210091);Specialized Research Fund for the Doctoral Program of Higher Education (Grant No. 20103401110002);Science and Technological Fund of Anhui Province for Outstanding Youth (Grant No. 10040606Y33);the Natural Science Foundation of Department of Education of Anhui Province (Grant Nos. KJ2011A195; KJ2010B136);Project of Anhui Province for Excellent Young Talents in Universities (Grant No. 2009SQRZ017ZD);Scientific Research Fund for Fostering Distinguished Young Scholars of Anhui University (Grant No. KJJQ1001);Project for Academic Innovation Team of Anhui University (Grant No. KJTD001B);Fund for Youth Scientific Research of Anhui University (Grant No. KJQN1003);Innovation Fund for Graduates of Anhui University
In this paper we investigate the least eigenvalue of a graph whose complement is connected, and present a lower bound for the least eigenvalue of such graph. We also characterize the unique graph whose least eigenvalu...
关键词：GRAPH COMPLEMENT adjacency matrix least eigenvalue. 
全选清除导出
共2页<12>
检索报告 对象比较 聚类工具 使用帮助 返回顶部