CAChristine Alar

Christine Alar

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

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article


Christine Alar has a total of 12 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Open Access

    The Sandpile Group of a Thick Cycle Graph

    by Diane Christine Alar, Jonathan Celaya, Luis David García Puente, Micah Henson, Ashley K. Wheeler

    The majority of graphs whose sandpile groups are known are either regular or simple. We give an explicit formula for a family of non-regular multi-graphs called thick cycles. A thick cycle graph is a cycle where multi-edges are permitted. Its sandpile group is the direct sum of cyclic groups of orders given by quotients of greatest common divisors of minors of its Laplacian matrix. We show these greatest common divisors can be expressed in terms of monomials in the graph's edge multiplicities.

  • Open Access

    Ordered multiplicity inverse eigenvalue problem for graphs on six vertices

    by John Ahn, Christine Alar, Beth Bjorkman, Steve Butler, Joshua Carlson, Audrey Goodnight, Haley Knox, Casandra Monroe, Michael C. Wigal

    For a graph $G$, we associate a family of real symmetric matrices, $\mathcal{S}(G)$, where for any $M \in \mathcal{S}(G)$, the location of the nonzero off-diagonal entries of $M$ are governed by the adjacency structure of $G$. The ordered multiplicity Inverse Eigenvalue Problem of a Graph (IEPG) is concerned with finding all attainable ordered lists of eigenvalue multiplicities for matrices in $\mathcal{S}(G)$. For connected graphs of order six, we offer significant progress on the IEPG, as well as a complete solution to the ordered multiplicity IEPG. We also show that while $K_{m,n}$ with $\min(m,n)\ge 3$ attains a particular ordered multiplicity list, it cannot do so with arbitrary spectrum.