# Questions tagged [algebraic-graph-theory]

Algebraic methods in Graph Theory; the linear algebra method, graph homomorphisms, group theoretic methods (for example Cayley graphs), and graph invariants. For graph eigenvalue problems use the spectral-graph-theory tag. For strongly regular graphs use the strongly-regular-graph tag. For Kneser graphs use the kneser-graph tag.

**1**

**1**answer

### Total behaviour of graph spectrum

**3**

**0**answers

### Vertex in a graph whose stabilizer (in a given group $\Gamma$ of automorphisms) does not fix any neighbour vertex?

**1**

**0**answers

### Symmetric subgraph configurations

**0**

**1**answer

### Elusive groups and vertex-transitive graphs

**9**

**0**answers

### Correspondence between matrix multiplication and a graph operation of Lovasz

**5**

**1**answer

### For what graph does the following algebraic property hold?

**2**

**1**answer

### History of algebraic graph theory

**6**

**1**answer

### Moore Graphs and Finite Projective Geometry

**4**

**1**answer

### Are there graphs with irrational eigenvalues which are all $>1$?

**0**

**1**answer

### Chromatic Polynomials of Circulant Graph With Two Parameters

**1**

**1**answer

### Bounds on singular values of invertible 0-1 matrices

**1**

**0**answers

### The number of Laplacian eigenvalues of a graph in interval [k,n]

**5**

**1**answer

### Inertia of a class of Cayley graphs

**4**

**1**answer

### Smallest pair of non-isomorphic graphs equivalent under the Weisfeiler-Leman algorithm

**4**

**0**answers

### For what (other) families of graphs does the clique-coclique bound hold?

**3**

**1**answer

### Are cospectral signed graphs with identical underlying graph necessarily switching-equivalent?

**1**

**1**answer

### Determinant of incidence matrix of a unicyclic unbalanced signed graph

**1**

**0**answers

### graphs with semiregular automorphisms

**1**

**1**answer

### Automorphism group of a graph

**7**

**2**answers

### Automorphism group of a special commuting graph

**8**

**2**answers

### Does the clique-coclique bound hold for all walk-regular graphs?

**1**

**1**answer

### Quantified imbalance in signed graphs

**3**

**1**answer

### Imbalance in a Signed Graph

**2**

**0**answers

### Cayley Graphs and Cyclically reduced words [closed]

**2**

**1**answer

### Graph algebras a la Lovasz

**7**

**3**answers

### Are there only finitely many distinct cubic walk-regular graphs that are neither vertex-transitive nor distance-regular?

**0**

**1**answer

### Find the minimum distance of some bad binary code

**1**

**0**answers

### We know $A_5$ as a non-CI-group. Now, is $A_5$ a BI-group?

**2**

**1**answer

### How many line graphs are there?

**0**

**1**answer

### DCI-properties of Cayley graphs

**1**

**0**answers

### incidence matrix

**-2**

**2**answers

### Is connected k-regular graphs are always vertex-transitive? [closed]

**3**

**1**answer

### Inertia of the cone graph

**2**

**1**answer

### Laplacian spectrum of directed network (digraph) and its complement

**4**

**1**answer

### Spectra of the quotient of a directed graph

**3**

**1**answer

### Counting graphs according to recursion depth

**12**

**1**answer

### A different avatar of the complexity of a graph

**0**

**1**answer

### Computing canonical forms from orbit partitions

**0**

**0**answers

### Intersection of ideals corresponding to simplicial complexes at different points?

**3**

**2**answers

### Characterizing graphs whose Incidence Matrix has the all ones vector in its row span

**6**

**2**answers

### A question about (unicity of certain cycles in a Cayley graph of a) symmetric group

**3**

**3**answers

### Graphs cospectral with Cayley graphs

**0**

**0**answers

### normal sets and conjugate generating sets of $S_n$

**6**

**3**answers

### Numerical invariants for a graph or its complement that are bounded by some constant

**2**

**0**answers

### Atomic parts of lexicographic products of vertex-transitive graphs

**4**

**1**answer

### Vertex-connectivity of connected, vertex-transitive graphs without $K_4$ is maximum possible

**0**

**1**answer

### Number of $k$-walks containing a vertex in an unweighted multigraph

**4**

**0**answers

### The degree/diameter problem for even girth graphs starting with upper bound

**9**

**3**answers

### Generating (or availability of) large strongly regular graphs

**8**

**1**answer