78,731 research outputs found
Self-Complementary Arc-Transitive Graphs and Their Imposters
This thesis explores two infinite families of self-complementary arc-transitive graphs: the familiar Paley graphs and the newly discovered Peisert graphs. After studying both families, we examine a result of Peisert which proves the Paley and Peisert graphs are the only self-complementary arc transitive graphs other than one exceptional graph. Then we consider other families of graphs which share many properties with the Paley and Peisert graphs. In particular, we construct an infinite family of self-complementary strongly regular graphs from affine planes. We also investigate the pseudo-Paley graphs of Weng, Qiu, Wang, and Xiang. Finally, we prove a lower bound on the number of maximal cliques of certain pseudo-Paley graphs, thereby distinguishing them from Paley graphs of the same order
On the binary codes with parameters of triply-shortened 1-perfect codes
We study properties of binary codes with parameters close to the parameters
of 1-perfect codes. An arbitrary binary code ,
i.e., a code with parameters of a triply-shortened extended Hamming code, is a
cell of an equitable partition of the -cube into six cells. An arbitrary
binary code , i.e., a code with parameters of a
triply-shortened Hamming code, is a cell of an equitable family (but not a
partition) from six cells. As a corollary, the codes and are completely
semiregular; i.e., the weight distribution of such a code depends only on the
minimal and maximal codeword weights and the code parameters. Moreover, if
is self-complementary, then it is completely regular. As an intermediate
result, we prove, in terms of distance distributions, a general criterion for a
partition of the vertices of a graph (from rather general class of graphs,
including the distance-regular graphs) to be equitable. Keywords: 1-perfect
code; triply-shortened 1-perfect code; equitable partition; perfect coloring;
weight distribution; distance distributionComment: 12 page
Self-Complementary Hypergraphs
In this thesis, we survey the current research into self-complementary hypergraphs,
and present several new results.
We characterize the cycle type of the permutations on n elements with order equal
to a power of 2 which are k-complementing. The k-complementing permutations map
the edges of a k-uniform hypergraph to the edges of its complement. This yields a test
to determine whether a finite permutation is a k-complementing permutation, and
an algorithm for generating all self-complementary k-uniform hypergraphs of order
n, up to isomorphism, for feasible n. We also obtain an alternative description of
the known necessary and sufficient conditions on the order of a self-complementary
k-uniform hypergraph in terms of the binary representation of k.
We examine the orders of t-subset-regular self-complementary uniform hyper-
graphs. These form examples of large sets of two isomorphic t-designs. We restate
the known necessary conditions on the order of these structures in terms of the binary
representation of the rank k, and we construct 1-subset-regular self-complementary
uniform hypergraphs to prove that these necessary conditions are sufficient for all
ranks k in the case where t = 1.
We construct vertex transitive self-complementary k-hypergraphs of order n for
all integers n which satisfy the known necessary conditions due to Potocnik and Sajna, and consequently prove that these necessary conditions are also sufficient. We
also generalize Potocnik and Sajna's necessary conditions on the order of a vertex transitive self-complementary uniform hypergraph for certain ranks k to give neces-
sary conditions on the order of these structures when they are t-fold-transitive. In
addition, we use Burnside's characterization of transitive groups of prime degree to
determine the group of automorphisms and antimorphisms of certain vertex transitive self-complementary k-uniform hypergraphs of prime order, and we present an
algorithm to generate all such hypergraphs.
Finally, we examine the orders of self-complementary non-uniform hypergraphs,
including the cases where these structures are t-subset-regular or t-fold-transitive. We find necessary conditions on the order of these structures, and we present constructions to show that in certain cases these necessary conditions are sufficient.University of OttawaDoctor of Philosophy in Mathematic
A short note on a short remark of Graham and Lov\'{a}sz
Let D be the distance matrix of a connected graph G and let nn(G), np(G) be
the number of strictly negative and positive eigenvalues of D respectively. It
was remarked in [1] that it is not known whether there is a graph for which
np(G) > nn (G). In this note we show that there exists an infinite number of
graphs satisfying the stated inequality, namely the conference graphs of order>
9. A large representative of this class being the Paley graphs.The result is
obtained by derving the eigenvalues of the distance matrix of a
strongly-regular graph.Comment: 5 pages, 3 figure
Some identities for enumerators of circulant graphs
We establish analytically several new identities connecting enumerators of
different types of circulant graphs of prime, twice prime and prime-squared
orders. In particular, it is shown that the semi-sum of the number of
undirected circulants and the number of undirected self-complementary
circulants of prime order is equal to the number of directed self-complementary
circulants of the same order.
Keywords: circulant graph; cycle index; cyclic group; nearly doubled primes;
Cunningham chain; self-complementary graph; tournament; mixed graphComment: 17 pages, 3 tables Categories: CO Combinatorics (NT Number Theory)
Math Subject Class: 05C30; 05A19; 11A4
- …