English
Related papers

Related papers: Outerplane bipartite graphs with isomorphic resona…

200 papers

We present a simple combinatorial model for quasipositive surfaces and positive braids, based on embedded bipartite graphs. As a first application, we extend the well-known duality on standard diagrams of torus links to twisted torus links.…

Geometric Topology · Mathematics 2011-11-17 Sebastian Baader

This paper is a survey on Extremal Graph Theory, primarily focusing on the case when one of the excluded graphs is bipartite. On one hand we give an introduction to this field and also describe many important results, methods, problems, and…

Combinatorics · Mathematics 2013-07-02 Zoltán Füredi , Miklós Simonovits

In earlier papers, we showed a decomposition of the arcs of 2-diregular digraphs (2-dds) and used it to prove some conditions for these graphs to be non-Hamiltonian; we then extended this decomposition to a larger class of digraphs and used…

Combinatorics · Mathematics 2026-01-27 Munagala V. Ramanath

We consider signed graphs, i.e, graphs with positive or negative signs on their edges. We construct some families of bipartite signed graphs with only two distinct eigenvalues. This leads to constructing infinite families of regular…

Combinatorics · Mathematics 2019-07-23 F. Ramezani

We prove the existence of "half-plane differentials" with prescribed local data on any Riemann surface. These are meromorphic quadratic differentials with higher-order poles which have an associated singular flat metric isometric to a…

Geometric Topology · Mathematics 2013-02-26 Subhojoy Gupta

We recall and define various kinds of supersingular $\ell$-isogeny graphs and precise graph isomorphism with a corresponding quaternion $\ell$-ideal graph. In particular, we introduce the notion of double-orientations on supersingular…

Number Theory · Mathematics 2025-10-20 Do Eon Cha , Imin Chen

We consider the infinite-dimensional hypercube graph. This graph is not connected and has isomorphic connected components. We describe the restrictions of its automorphisms to the connected components and the automorphism group of connected…

Combinatorics · Mathematics 2011-06-16 Mark Pankov

Graphs derived from groups are a widely studied class of graphs, motivated by their highly symmetric structure. In particular, G-graphs offer an easy and interesting alternative construction of semi-symmetric graphs. After recalling the…

Combinatorics · Mathematics 2016-11-25 David Ellison , Ruxandra Marinescu-Ghemeci , Cerasela Tanasescu

Motivated by the rich theory of harmonic maps from a 2-sphere, we study biharmonic maps from a 2-sphere in this paper. We first derive biharmonic equation for rotationally symmetric maps between rotationally symmetric 2-manifolds. We then…

Differential Geometry · Mathematics 2015-06-17 Ze-Ping Wang , Ye-Lin Ou , Han-Chun Yang

Structures of commuting semigroups of isometries under certain additional assumptions like double commutativity or dual double commutativity are found.

Functional Analysis · Mathematics 2023-06-27 Tirthankar Bhattacharyya , Shubham Rastogi , Vijaya Kumar U

A graph is rectilinear planar if it admits a planar orthogonal drawing without bends. While testing rectilinear planarity is NP-hard in general (Garg and Tamassia, 2001), it is a long-standing open problem to establish a tight upper bound…

Data Structures and Algorithms · Computer Science 2023-06-23 Walter Didimo , Michael Kaufmann , Giuseppe Liotta , Giacomo Ortali

We introduce a notion of bipartite minors and prove a bipartite analog of Wagner's theorem: a bipartite graph is planar if and only if it does not contain $K_{3,3}$ as a bipartite minor. Similarly, we provide a forbidden minor…

Combinatorics · Mathematics 2013-12-03 Maria Chudnovsky , Gil Kalai , Eran Nevo , Isabella Novik , Paul Seymour

Johnson and Livingston have characterized peripheral structures in homomorphs of knot groups. We extend their approach to the case of links. The main result is an algebraic characterization of all possible peripheral structures in certain…

Geometric Topology · Mathematics 2007-05-23 V. Kurlin , D. Lines

We present a robust method to find region-level correspondences between shapes, which are invariant to changes in geometry and applicable across multiple shape representations. We generate simplified shape graphs by jointly decomposing the…

Graphics · Computer Science 2018-03-06 Yanir Kleiman , Maks Ovsjanikov

Let $P$ be a graph with a vertex $v$ such that $P\backslash v$ is a forest, and let $Q$ be an outerplanar graph. We prove that there exists a number $p=p(P,Q)$ such that every 2-connected graph of path-width at least $p$ has a minor…

Combinatorics · Mathematics 2018-04-17 Thanh N. Dang , Robin Thomas

In this paper we present a class of four-dimensional bi-rational maps with two invariants satisfying certain constraints on degrees. We discuss the integrability properties of these maps from the point of view of degree growth and Liouville…

Exactly Solvable and Integrable Systems · Physics 2020-04-22 G. Gubbiotti , N. Joshi , D. T. Tran , C-M. Viallet

A Graph is called 2-self-centered if its diameter and radius both equal to 2. In this paper, we begin characterizing these graphs by characterizing edge-maximal 2-self-centered graphs via their complements. Then we split characterizing…

Combinatorics · Mathematics 2019-10-29 Mohammad Hadi Shekarriz , Madjid Mirzavaziri , Kamyar Mirzavaziri

Bidirected graphs are multigraphs where every edge has an independent direction at each end. In the paper, with an arbitrary bidirected graph we associate a non-negative integral quadratic form (called the incidence form of the graph), and…

Combinatorics · Mathematics 2024-07-09 Jesús Arturo Jiménez González , Andrzej Mróz

In this paper we will look at the relationship between the intersection number c2 and its diameter for a distance-regular graph. And also, we give some tools to show that a distance-regular graph with large c2 is bipartite, and a tool to…

Combinatorics · Mathematics 2011-09-13 Jack H. Koolen , Jongyook Park

This paper presents a phenomenon which sometimes occurs in tetravalent bipartite locally dart-transitive graphs, called a Base Graph -- Connection Graph dissection. In this dissection, each white vertex is split into two vertices of valence…

Combinatorics · Mathematics 2020-04-07 Gabriel Verret , Primož Potočnik , Steve Wilson