哈尔滨工程大学学报2016，Vol.37Issue(12)：1739-1742,4.DOI:10.11990/jheu.201511033
广义剖分冠点图的邻接特征多项式
Adjacency characteristic polynomial of generalized subdivision corona vertex graph
摘要
Abstract
Corona graph is a composite graph obtained by graph operation from two graphs G and H . Some classes of corona graphs have been defined and studied. However, all the corona graphs in the literatures were defined as all kinds of corona graphs of graph G and H, in which graph H was n copies of grap H . By generalizing n copies of graph to arbitrary graphs in the definition of corona, a new class of corona was defined:the generalized subdivision corona vertex graph. Let S( G) be the subdivision graph of graph G by inserting a new vertex into every edge of G. Joining the ith vertex of V( G) to every vertex of Hi , the generalized subdivision corona vertex graph from graph S( G) and graph H1 ,H2 ,…,Hn was obtained, which was denoted by S( G)☉∧n Hi . With the help of block matrix, the coronal and Schur complement, the adjacency characteristic polynomial of the generalized subdivision corona vertex graph was de-termined. A method to construct infinite pairs of cospectral graphs was proposed and an example was given.关键词
组合图/广义剖分冠点图/邻接特征多项式/正则图/同谱图Key words
composite graph/generalized subdivision corona vertex graph/adjacency characteristic polynomial/regular graphs/cospectral graphs分类
数理科学引用本文复制引用
卢鹏丽,武雨末..广义剖分冠点图的邻接特征多项式[J].哈尔滨工程大学学报,2016,37(12):1739-1742,4.基金项目
国家自然科学基金项目（11361033）． （）
