Related papers: Theta characteristics of hyperelliptic graphs

Let $K_d$ be the complete metric graph on $d$ vertices. We compute the gonality of graphs obtained from $K_d$ by omitting edges forming a $K_h$, or general configurations of at most $d-2$ edges. We also investigate if these graphs can be…

In this paper, we determine the reduced automorphism groups of hyperelliptic curves of a small genus in characteristic $2$, when they are of $2$-rank $0$. Such a curve is an Artin-Schreier curve defined in the form $y^2-y=f(x)$ for a…

We prove that for any number field $K$ and any fixed genus $g \geq 2$, there are infinitely many non-isomorphic hyperelliptic curves of genus $g$ over $K$ whose Jacobians have rank over $K$ equal to each of 0, 1, or 2. As an example of our…

In a graph A, for each two arbitrary vertices g, h with d(g,h)=2,|MAg2h|=mAg2h is introduced the number of edges of A that are closer to g than to h. We say A is a 2-edge distance-balanced graph if we have mAg2h=mAh2g. In this article, we…

Let $\phi_c(G)$ be the circular flow number of a bridgeless graph $G$. In [Edge-colorings and circular flow numbers of regular graphs, J. Graph Theory 79 (2015) 1-7] it was proved that, for every $t \geq 1$, $G$ is a bridgeless…

We investigate the bounds on algebraic connectivity of graphs subject to constraints on the number of edges, vertices, and topology. We show that the algebraic connectivity for any tree on $n$ vertices and with maximum degree $d$ is bounded…

In this paper, we show that there exist families of curves (defined over an algebraically closed field $k$ of characteristic $p >2$) whose Jacobians have interesting $p$-torsion. For example, for every $0 \leq f \leq g$, we find the…

Let G be a graph of hyperbolic groups with 2-ended edge groups. We show that G is hierarchically hyperbolic if and only if G has no distorted infinite cyclic subgroup. More precisely, we show that G is hierarchically hyperbolic if and only…

For each group $G$, $(|G| > 2)$ \, which acts as a full automorphism group on a genus 3 hyperelliptic curve, we determine the family of curves which have 2-Weierstrass points. Such families of curves are explicitly determined in terms of…

We examine connections between the gonality, treewidth, and orientable genus of a graph. Especially, we find that hyperelliptic graphs in the sense of Baker and Norine are planar. We give a notion of a bielliptic graph and show that each of…

Stark and Terras introduced the edge zeta function of a finite graph in 1996. The edge zeta function is the reciprocal of a polynomial in twice as many variables as edges in the graph and can be computed in polynomial time. We look at graph…

It is known that Paley graphs of square order have the strict-EKR property, that is, all maximum cliques are canonical cliques. Peisert-type graphs are natural generalizations of Paley graphs and some of them also have the strict-EKR…

We show that every 2-degenerate graph with maximum degree $\Delta$ has a strong edge-coloring with at most $8\Delta-4$ colors.

Genus $g$ Torelli space is the moduli space of genus $g$ curves of compact type equipped with a homology framing. The hyperelliptic locus is a closed analytic subvariety consisting of finitely many mutually isomorphic components. We use…

A coloring is distinguishing (or symmetry breaking) if no non-identity automorphism preserves it. The distinguishing threshold of a graph $G$, denoted by $\theta(G)$, is the minimum number of colors $k$ so that every $k$-coloring of $G$ is…

In this paper, we study non-hyperelliptic curves of genus $3$ with cyclic automorphism group of order $6$. Over an algebraically closed field $K$ of characteristic $\neq 2,3$, such curves are written as plane quartics $C_r: x^3 z + y^4 + r…

Let $\mathcal{X}$ be an irreducible, non-singular, algebraic curve defined over a field of odd characteristic $p$. Let $g$ and $\gamma$ be the genus and $p$-rank of $\mathcal{X}$, respectively. The influence of $g$ and $\gamma$ on the…

A theta graph $\theta_{r,p,q}$ is the graph obtained by connecting two distinct vertices with three internally disjoint paths of length $r,p,q$, where $q\geq p\geq r\geq1$ and $p\geq2$. A graph is $\theta_{r,p,q}$-free if it does not…

The theta graph $\Theta_{\ell,t}$ consists of two vertices joined by $t$ vertex-disjoint paths of length $\ell$ each. For fixed odd $\ell$ and large $t$, we show that the largest graph not containing $\Theta_{\ell,t}$ has at most $c_{\ell}…

We investigate a class of odd (ramification) coverings $C \to \mathbb{P}^1$ where $C$ is hyperelliptic, its Weierstrass points maps to one fixed point of $\mathbb{P}^1$ and the covering map makes the hyperelliptic involution of $C$ commute…