Some New Properties of Integral Circulant Graphs
Huang Hong-di
Abstract
Huang Hong-di
Abstract
Integral circulant graph Xn(D) has the vertex set Zn={0,1,2,…,n-1},and vertices a and b are adjacent if and only if gcd(a-b,n)∈D,where D is a set of positive and proper divisors of n.The planarity,independence number and edge chromatic number of some integral circulant graph are studies,and the size of the maximum matching of integral circulant graphs is completely evaluated.
A significance statement is not available in the OpenAlex record.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
Integral circulant graph Xn(D) has the vertex set Zn={0,1,2,…,n-1},and vertices a and b are adjacent if and only if gcd(a-b,n)∈D,where D is a set of positive and proper divisors of n.The planarity,independence number and edge chromatic number of some integral circulant graph are studies,and the size of the maximum matching of integral circulant graphs is completely evaluated.
Key concepts: Circulant matrix, Mathematics, Combinatorics, Circulant graph, Vertex (graph theory), Planarity testing, Discrete mathematics, Graph