Polynomials of Unitary Cayley Graphs

被引：3

作者：

Basic, Milan ^{[1
]}

Ilic, Aleksandar ^{[1
]}

机构：

[1] Univ Nis, Fac Sci & Math, Nish, Serbia

来源：

FILOMAT | 2015年 / 29卷 / 09期

关键词：

Unitary Cayley graph; Clique polynomial; Distance polynomial; Independence polynomial; Laplacian polynomial; CIRCULANT NETWORKS; ENERGY; NUMBER;

D O I：

10.2298/FIL1509079B

中图分类号：

O29 [应用数学];

学科分类号：

070104 ;

摘要：

The unitary Cayley graph Xn has the vertex set Z(n) = {0, 1, 2, .., n-1} and vertices a and b are adjacent, if and only if gcd(a-b, n) = 1. In this paper, we present some properties of the clique, independence and distance polynomials of the unitary Cayley graphs and generalize some of the results from [W. Klotz, T. Sander, Some properties of unitary Cayley graphs, Electr. J. Comb. 14 (2007), #R45]. In addition, using some properties of Laplacian polynomial we determine the number of minimal spanning trees of any unitary Cayley graph.

引用

页码：2079 / 2086

页数：8

共 12 条

[1]

[Anonymous], 2005, INTRO ANAL NUMBER TH

[2] Which weighted circulant networks have perfect state transfer? [J].