Some Algebraic Properties of BiCayley Graph Hua 双Cayley图华的一些代数性质.pptVIP

下载本文档

5
0
约2.94千字
约 16页
2017-03-08 发布于上海
举报
版权申诉

Some Algebraic Properties of BiCayley Graph Hua 双Cayley图华的一些代数性质.ppt

1、本文档共16页，可阅读全部内容。
2、原创力文档（book118）网站文档一经付费（服务费），不意味着购买了该文档的版权，仅供个人/单位学习、研究之用，不得用于商业用途，未经授权，严禁复制、发行、汇编、翻译或者网络传播等，侵权必究。
3、本站所有内容均由合作方或网友上传，本站不对文档的完整性、权威性及其观点立场正确性做任何保证或承诺！文档内容仅供研究参考，付费前请自行鉴别。如您付费，意味着您自己接受本站规则且自行承担风险，本站不退款、不进行额外附加服务；查看《如何避免下载的几个坑》。如果您已付费下载过本站文档，您可以点击这里二次下载。
4、如文档侵犯商业秘密、侵犯著作权、侵犯人身权等，请点击“版权申诉”（推荐），也可以打举报电话：400-050-0827(电话支持时间：9:00-18:30)。
5、该文档为VIP文档，如果想要下载，成为VIP会员后，下载免费。
6、成为VIP后，下载本文档将扣除1次下载权益。下载后，不支持退款、换文档。如有疑问请联系我们。
7、成为VIP后，您将拥有八大权益，权益包括：VIP文档下载权益、阅读免打扰、文档格式转换、高级专利检索、专属身份标志、高级客服、多端互通、版权登记。
8、VIP文档为合作方或网友上传，每下载1次，网站将根据用户上传文档的质量评分、类型等，对文档贡献者给予高额补贴、流量扶持。如果你也想贡献VIP文档。上传文档

Some Algebraic Properties of BiCayley Graph Hua 双Cayley图华的一些代数性质

Some Algebraic Properties of Bi-Cayley Graphs Hua Zou and Jixiang Meng College of Mathematics and Systems Science,Xinjiang University Example: Since the eigenvalues of an undirected graph are real, we deduce the following corollary by Theorem 2.2 . Theorem2.4. Let G be a cyclic group of integers modulo n and be a subset of G. Theorem 2.8. Let BC(G,S) be the connected Bi-Circulant graph of order n. Then Theorem 2.9.Let BC(G,S) be the connected Bi-irculant graph of order n.Then 3.Recent Main Result For a digraph D with , we define Thank You! * * Circulant Graph When G is a cyclic group, the Cayley digraph(graph) D(G;S)(C(G;S)) is called a circulant digraph(graph). Cayley Graph For a group G and a subset S of G, the Cayley digraph D(G; S) is a graph with vertex set G and arc set . When ,D(G,S) corresponds to an undirected graph C(G,S), which is called a Cayley graph. 1.Definition Bi-Cayley Graph For a finite group G and a subset T of G, the Bi-Cayley graph X=BC(G,T) is defined as the bipartite graph with vertex set and edge set Theorem2.2. Let G be an abelian group and let be the eigenvalues of the Cayley digraph D(G,S). Then the eigenvalues of BC(G,S) are Theorem 2.1. The adjacency matrix of a Cayley digraph of abelian group is normal. We use T(G,S) to denote the number of spanning trees of a Connected Bi-Circulant graph BC(G,S). 2.Main Result Corollary 2.3. Let be the eigenvalues of C(G,S). Then the eigenvalues of BC(G,S) are (2)If S=-S, the eigenvalues of the Bi-Circulant graph BC(G,S) are (1)The eigenvalues of the Bi-Circulant digraph BC(G,S) are Theorem2.5. Let G be a cyclic group of integers modulo n and S be a subset of G.If S is a union of