ABAlejandra Brewer

Alejandra Brewer

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article

Previous Organizations / Institutes

The organizations / institutes from the scholar's other articles in the past ten years


Alejandra Brewer has a total of 10 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Open Access

    The asymmetric index of a graph

    by Darren Narayan, Alejandra Brewer, Adam Gregory, Quindel Jones, Natalie Gomez, Emma Farnsworth, Brendan Rooney, Herlandt Lino

    A graph $G$ is asymmetric if its automorphism group is trivial. Asymmetric graphs were introduced by Erdős and Rényi (1963). They suggested the problem of starting with an asymmetric graph and removing some number $r$ of edges and/or adding some number $s$ of edges so that the resulting graph is nonasymmetric. Erdős and Rényi defined the degree of asymmetry of a graph to be the minimum value of $r+s$. In this paper, we define another property that measures how close a given nonasymmetric graph is to being asymmetric. We define the asymmetric index of a graph $G$, denoted $ai(G)$, to be the minimum of $r+s$ so that the resulting graph $G$ is asymmetric. We investigate the asymmetric index of both connected and disconnected graphs. We prove that for any nonnegative integer $k$, there exists a graph $G$ where $ai(G)=k$. We show that the asymmetric index of a cycle with at least six vertices is two, and provide a complete characterization of all possible pairs of edges that can be added to a cycle to create an asymmetric graph. In addition we determine the asymmetric index of paths, certain circulant graphs, Cartesian products involving paths and cycles, and bounds for complete graphs, and complete bipartite graphs.

  • Open Access

    Infinite Families of Asymmetric Graphs

    by Alejandra Brewer, Adam Gregory, Quindel Jones, Luke Rodriguez, Rigoberto Flórez, Darren Narayan

    A graph $G$ is \textit{asymmetric} if its automorphism group of vertices is trivial. Asymmetric graphs were introduced by Erd\H{o}s and R\'{e}nyi in 1963. They showed that the probability of a graph on $n$ vertices being asymmetric tends to $1$ as $n$ tends to infinity. In this paper, we first give consider the number of asymmetric trees, a question posed by Erd\H{o}s and R\'enyi. We give a partial result, showing that the number of asymmetric subdivided stars is approximately $q(n-1) - \lfloor \frac{n-1}{2} \rfloor$ where $q(n)$ is the number of ways to sum to $n$ using distinct positive integers, found by Hardy and Ramanujan in 1918. We also investigate cubic Hamiltonian graphs where asymmetry, at least for small values of $n$, seems to be rare. It is known that none of the cubic Hamiltonian graphs on $4\leq n\leq 10$ vertices are asymmetric, and of the $80$ cubic Hamiltonian graphs on $12$ vertices only $5$ are asymmetric. We give a construction of an infinite family of cubic Hamiltonian graphs that are asymmetric. Then we present an infinite family of quartic Hamiltonian graphs that are asymmetric. We use both of the above results for cubic and quartic asymmetric Hamiltonian graphs to establish the existence of $k$-regular asymmetric Hamiltonian graphs for all $k\geq 3$.