检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
出 处:《现代电子技术》2012年第16期95-97,100,共4页Modern Electronics Technique
基 金:国家自然科学基金资助项目:有向网络的可靠性研究(60863006);青海地区自然科学基金资助项目:基于超图理论的复杂网络模型构建及性质研究(61164005)
摘 要:为了探讨一类奇单圈图的Signless Laplacian谱惟一的的问题,利用图与其线图之间的关系,图与其多项系数之间的关系以及图与其同谱图之间的关系,证明了Signless Laplacian同谱图的一个重要的的结构,即:恰含一个奇单圈图的Signless Laplacian同谱图也是一个连通奇单圈图。在此基础上证明了一类奇单圈图的Signless Laplacian谱惟一性,确定了此类奇单圈图的结构。To investigate the first-class odd cycle graphs determined by the Signless Laplacian spectrum,the very important structure of Signless Laplacian cospectral graph was proved by using relation between graphs and their line graphs,relation between graphs and polynomial coefficients,and relation between of the graph ahd its cospectral graphs.That is,the Signless Laplacian cospectral graph containing an odd cycle graph is a connected odd cycle graph.On that basis,the uniqueness of Signless Laplacian spectrum of first-class odd cycle graphs was demonstrated,and the structure of this type of odd cycle graphs was determined.It makes the graphs more extensively applied to the research of network reliability and complex network models.
关 键 词:奇单圈图 同谱图 Signless LAPLACIAN谱 线图
分 类 号:TN911-34[电子电信—通信与信息系统]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.117