• Refine Query
  • Source
  • Publication year
  • to
  • Language
  • 1
  • Tagged with
  • 2
  • 2
  • 1
  • 1
  • 1
  • 1
  • 1
  • About
  • The Global ETD Search service is a free service for researchers to find electronic theses and dissertations. This service is provided by the Networked Digital Library of Theses and Dissertations.
    Our metadata is collected from universities around the world. If you manage a university/consortium/country archive and want to be added, details can be found on the NDLTD website.
1

Star extremal of circulant graphs

Tu, Sheng-hsien 09 June 2004 (has links)
A graph is called star extremal if its fractional chromatic number is equal to its circular chromatic number. Given integers n,k,k' such that 1<=k<=k'<=n/2,the circulant graph G(n,S_k,k') has vertex set [n]={0,1,2,...,n-1} in which i~j if k<=|i-j|<=k' or n-k'<= |i-j|<=n-k. It was known that for n=q(k+k')+r,where 0<=r <k+k', if k'>=5/4k,then G(n,S_k,k') is star extremal. In the thesis, we prove that if k'>=7/6k and q>=4, then G(n,S_k,k') is star extremal.
2

Circulant Digraph Isomorphisms

Cancela, Elias 12 August 2016 (has links)
We determine necessary and sufficient conditions for a Cayley digraph of the cyclic group of order n to have the property that any other Cayley digraph of a cyclic group of order n is isomorphic to the first if and only if an isomorphism between the two digraphs is a group automorphism of the cyclic group of order n.

Page generated in 0.0756 seconds