English
Related papers

Related papers: On balanced planar graphs, following W. Thurston

200 papers

Let $\Gamma$ be a graph with diameter at least two. Then $\Gamma$ is said to be $1$-homogeneous (in the sense of Nomura) whenever for every pair of adjacent vertices $x$ and $y$ in $\Gamma$, the distance partition of the vertex set of…

Combinatorics · Mathematics 2026-01-15 Jack H. Koolen , Mamoon Abdullah , Brhane Gebremichel , Jae-Ho Lee

We study regular graphs whose distance-$2$ graph or distance-$1$-or-$2$ graph is strongly regular. We provide a characterization of such graphs $\Gamma$ (among regular graphs with few distinct eigenvalues) in terms of the spectrum and the…

Combinatorics · Mathematics 2019-02-28 C. Dalfó , M. A. Fiol , J. Koolen

As it is well known, the spectrum $ {\rm sp\,} \Gamma$ (of the adjacency matrix $A$) of a graph $\Gamma$, with $d$ distinct eigenvalues other than its spectral radius $\lambda_0$, usually provides a lot of information about the structure of…

Combinatorics · Mathematics 2016-08-02 V. Diego , J. Fàbrega , M. A. Fiol

We prove that in the moduli space of genus-g metric graphs the locus of graphs with gonality at most d has the classical dimension min{3g-3,2g+2d-5}. This follows from a careful parameter count to establish the upper bound and a…

Combinatorics · Mathematics 2017-10-10 Filip Cools , Jan Draisma

Let $\Gamma=(X,\mathcal{R})$ denote a finite, simple, connected, and undirected non-bipartite graph with vertex set $X$ and edge set $\mathcal{R}$. Fix a vertex $x \in X$, and define $\mathcal{R}_f = \mathcal{R} \setminus \{yz \mid…

Combinatorics · Mathematics 2023-09-01 Blas Fernández , Roghayeh Maleki , Štefko Miklavič , Giusy Monzillo

The spectral properties of signed directed graphs, which may be naturally obtained by assigning a sign to each edge of a directed graph, have received substantially less attention than those of their undirected and/or unsigned counterparts.…

Combinatorics · Mathematics 2021-10-12 Pepijn Wissing , Edwin R. van Dam

Let $\Sigma$ denote a closed surface with constant mean curvature in $\mathbb{G}^3$, a 3-dimensional Lie group equipped with a bi-invariant metric. For such surfaces, there is a harmonic Gauss map which maps values to the unit sphere within…

Differential Geometry · Mathematics 2026-01-22 Alcides de Carvalho , Marcos P. Cavalcante , Wagner Costa-Filho , Darlan de Oliveira

We determine all Hermitian $\mathcal{O}_{\Q(\sqrt{d})}$-matrices for which every eigenvalue is in the interval [-2,2], for each d in {-2,-7,-11,-15\}. To do so, we generalise charged signed graphs to $\mathcal{L}$-graphs for appropriate…

Number Theory · Mathematics 2011-03-24 Graeme Taylor

Let $\Gamma$ be a distance-regular graph with classical parameters $(D, b, \alpha, \beta)$ satisfying $b\geq 2$ and $D\geq 3$. Let $r=1+b+b^2+\cdots+b^{D-1}$. In 1999, K. Metsch showed that there exists a positive constant $C(\alpha,b)$…

Combinatorics · Mathematics 2025-12-22 Chenhui Lv , Jack H. Koolen

For a degree d self branched covering of the 2-sphere, a notable combinatorial invariant is an integer partition of 2d -- 2, consisting of the multiplicities of the critical points. A finer invariant is the so called Hurwitz passport. The…

Dynamical Systems · Mathematics 2015-04-07 J. Tomasini

Hurwitz numbers enumerate branched morphisms between Riemann surfaces. For a fixed elliptic target, Hurwitz numbers are intimately related to mirror symmetry following work of Dijkgraaf. In recent work of Chapuy and Dolega a new variant of…

Combinatorics · Mathematics 2024-10-28 Marvin Anas Hahn , Hannah Markwig

Let $\Gamma$ denote a distance-regular graph with classical parameters $(D, b, \alpha, \beta)$ and $D\geq 3$. Assume the intersection numbers $a_1=0$ and $a_2\not=0$. We show $\Gamma$ is 3-bounded in the sense of the article [D-bounded…

Combinatorics · Mathematics 2007-09-06 Yeh-jong Pan , Chih-wen Weng

A pair of graphs $(\Gamma,\Sigma)$ is called unstable if their direct product $\Gamma\times\Sigma$ admits automorphisms not from $\mathrm{Aut}(\Gamma)\times\mathrm{Aut}(\Sigma)$, and such automorphisms are said to be unexpected. The…

Combinatorics · Mathematics 2026-05-25 Xiaomeng Wang , Yan-Li Qin , Binzhou Xia

In the early 1980's Thurston gave a topological characterization of rational maps whose critical points have finite iterated orbits (\cite{Th,DH1}): given a topological branched covering $F$ of the two sphere with finite critical orbits, if…

Dynamical Systems · Mathematics 2014-07-15 Cui Guizhen , Tan Lei

Let $\Sigma=(\Gamma, \sigma)$ is a signed graph(or sigraph in short), where $\Gamma$ is a underlying graph of $\Sigma$ and $\sigma:E\longrightarrow \{+, -\}$ is a function. Consider $\Gamma=Cay(\mathbb{Z}_{p_{1}}\times…

Combinatorics · Mathematics 2020-11-12 Mohammad A. Iranmanesh , Nasrin Moghaddami

The sigma index of a graph, defined as the population variance of its degree sequence, is a fundamental measure of structural irregularity. In this paper, we introduce and systematically investigate its natural extension to fuzzy graphs,…

General Mathematics · Mathematics 2026-04-16 Duaa Abdullah

Let $\Gamma$ be a Cayley graph, or a Cayley sum graph, or a twisted Cayley graph, or a twisted Cayley sum graph, or a vertex-transitive graph. Suppose $\Gamma$ is undirected and non-bipartite. Let $\mu$ (resp. $\mu_2$) denote the smallest…

Combinatorics · Mathematics 2023-12-12 Jyoti Prakash Saha

We determine the number of labelled chordal planar graphs with $n$ vertices, which is asymptotically $c_1\cdot n^{-5/2} \gamma^n n!$ for a constant $c_1>0$ and $\gamma \approx 11.89235$. We also determine the number of rooted simple chordal…

Combinatorics · Mathematics 2022-04-12 Jordi Castellví , Marc Noy , Clément Requilé

A graph $\Gamma$ is $G$-symmetric if it admits $G$ as a group of automorphisms acting transitively on the set of arcs of $\Gamma$, where an arc is an ordered pair of adjacent vertices. Let $\Gamma$ be a $G$-symmetric graph such that its…

Combinatorics · Mathematics 2024-03-05 Teng Fang , Sanming Zhou , Shenglin Zhou

A $biased\ graph$ is a pair $(G,\mathcal{B})$, where $G$ is a graph and $\mathcal{B}$ is a collection of `balanced' circuits of $G$ such that no $\Theta$-subgraph of $G$ contains precisely two balanced circuits. We prove a Ramsey-type…

Combinatorics · Mathematics 2018-03-28 Peter Nelson , Sophia Park