检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]厦门大学数学科学学院,福建厦门361005 [2]集美大学理学院,福建厦门361021
出 处:《数学研究》2012年第4期321-330,共10页Journal of Mathematical Study
基 金:supported by NSFC(11171279,11171134,10831001)
摘 要:G是顶点集为{v_1,v_2,…,v_n}的连通简单图,G_1,G_2,…,G_n是有限图。联并图G[G_1,G_2,…,G_n】是按如下方式在G_1UG_2U…UG_n上加边而成的图:在G_i和G_j之间的任何两个顶点间加边,若v_i和v_j在G中相邻.[7]给出了两个距离正则图的卡氏积的距离谱.本文计算了联并图和距离正则图的卡氏积及两个联并图的卡氏积的距离谱.在此基础之上,我们得到了两个利用联并图与非同谱距离正则等能量图作卡氏积及联并图作卡氏积构造非同谱等距离能量图族的方法.A joined union G[G1,G2 ,…Gn] is a graph obtained from the union of graphs G1,G2,…,Gn, by adding MI edges between Gi and Gj, whenever in G vi and vj are adjacent, where G is a simple connected graph with vertex set {v1,v2,…,vn} and Gj a finite graph for Vj ∈ {1, 2,… , n}( a joined union might not be distance regular). In [7] the distance spectrum of the cartesian product of two distance regular graphs was given. In the present paper, we compute distance spectra of Cartesian products of a joined union and a distance regular graph and Cartesian products of two joined unions. Based on these results, two methods for constructing groups of distance noncospectral equienergetic graphs from Cartesian products of joined unions and distance regular noncospectral equienergetic graphs and Cartesian products of joined unions are given.
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.37