On the nullspace of arc-transitive graphs over finite fields

  title={On the nullspace of arc-transitive graphs over finite fields},
  author={Primo{\vz} Poto{\vc}nik and Pablo Spiga and Gabriel Verret},
  journal={Journal of Algebraic Combinatorics},
Let A be the adjacency matrix of a graph Γ. The nullity of A (that is, the dimension of the nullspace of A), when viewed as a matrix over a field of prime characteristic p, is called the p-nullity of Γ. We present several families of arc-transitive graphs with arbitrarily large p-nullity. We also show that the p-nullity of a vertex-transitive graph of order a power of p is zero, provided that the valency of the graph is coprime to p. 
On the order of arc-stabilisers in arc-transitive graphs with prescribed local group
Let $\Gamma$ be a connected $G$-arc-transitive graph, let $uv$ be an arc of $\Gamma$ and let $L$ be the permutation group induced by the action of the vertex-stabiliser $G_v$ on the neighbourhood
Three local actions in 6‐valent arc‐transitive graphs
The only transitive permutation groups of degree at most $7$ for which the existence of such a family was undecided are constructed, and an infinite family of cubic-arc-transitive graphs is constructed such that the dimension of the $1$-eigenspace over the field of order $2$ of the adjacency matrix of thegraph grows linearly with the order of the graph.
LDPC codes constructed from cubic symmetric graphs
This paper presents a construction of LDPC codes from cubic symmetric graphs, and analyses properties of the obtained codes and presents bounds for the code parameters, the dimension and the minimum distance.


On the p-Rank of the Adjacency Matrices of Strongly Regular Graphs
AbstractLet Γ be a strongly regular graph with adjacency matrix A. Let I be the identity matrix, and J the all-1 matrix. Let p be a prime. Our aim is to study the p-rank (that is, the rank over
Presentations for (G,s)-transitive graphs of small valency
Given a group G , a subgroup H and an element a ∈ G , we define Γ( G, H, a ) to be the graph on the set of left-cosets of H in G , where two left-cosets g 1 H and g 2 H are adjacent whenever . We
Projective Planes, Graphs, and Simple Algebras
Abstract Let X be a projective plane of order n. A flag x0 ∈ l0 in X determines a graph F which is used to construct a central simple Jordan algebra A of dimension n3 − 1 over a field k of
Matrices for graphs, designs and codes
  • W. Haemers
  • Mathematics
    Information Security, Coding Theory and Related Combinatorics
  • 2011
This work considers graphs for which the corresponding design is a (symmetric) block design or (group) divisible design, and considers the binary code of a strongly regular graph.
Algebraic Graph Theory
The Laplacian of a Graph and Cuts and Flows are compared to the Rank Polynomial.
Binary Codes of Strongly Regular Graphs
The binary codes generated by A and A + I are determined and the codes of all strongly regular graphs on fewer than 45 vertices are generated by computer.
Transitive group actions: (im)primitivity and semiregular subgroups
The following problem is considered: if $$H$$H is a semiregular abelian subgroup of a transitive permutation group $$G$$G acting on a finite set $$X$$X, find conditions for (non)existence of
Chromatic Number and the 2-Rank of a Graph
We show that if the adjacency matrix of a graph X has 2-rank 2r, then the chromatic number of X is at most 2r+1, and that this bound is tight.