English
Related papers

Related papers: On $\lambda$-fold relative Heffter arrays and biem…

200 papers

In this paper, a theorem is proved that generalizes several existing amalgamation results in various ways. The main aim is to disentangle a given edge-colored amalgamated graph so that the result is a graph in which the edges are shared out…

Combinatorics · Mathematics 2017-10-12 Amin Bahmanian , Chris Rodger

This manuscript introduces Diophantine labeling, a new way of labeling of the vertices for finite simple undirected graphs with some divisibility condition on the edges. Maximal graphs admitting Diophantine labeling are investigated and…

Combinatorics · Mathematics 2026-01-01 A. Nasr , A. Elsonbaty , M. A. Seoud , M. Anwar

A graph G is {\xi}-nearly planar if it can be embedded in the sphere so that each of its edges is crossed at most {\xi} times. The family of {\xi}-nearly planar graphs is widely extending the notion of planarity. We introduce an alternative…

Combinatorics · Mathematics 2013-11-04 Alexander Grigoriev , Athanassios Koutsonas , Dimitrios M. Thilikos

In this paper, we extend the recently introduced concept of partially dual ribbon graphs to graphs. We then go on to characterize partial duality of graphs in terms of bijections between edge sets of corresponding graphs. This result…

Combinatorics · Mathematics 2012-03-01 Iain Moffatt

Typical graph embeddings may not capture type-specific bipartite graph features that arise in such areas as recommender systems, data visualization, and drug discovery. Machine learning methods utilized in these applications would be better…

Machine Learning · Computer Science 2020-07-24 Justin Sybrandt , Ilya Safro

Mixed graphs can be seen as digraphs with arcs and edges (or digons, that is, two opposite arcs). In this paper, we consider the case where such graphs are bipartite and in which the undirected and directed degrees are one. The best graphs,…

Combinatorics · Mathematics 2024-03-29 C. Dalfó , G. Erskine , G. Exoo , M. A. Fiol , J. Tuite

In 2010, Butler introduced the unfolding operation on a bipartite graph to produce two bipartite graphs, which are cospectral for the adjacency and the normalized Laplacian matrices. In this article, we describe how the idea of unfolding a…

Combinatorics · Mathematics 2024-11-22 M. Rajesh Kannan , Shivaramakrishna Pragada , Hitesh Wankhede

Local complement is a graph operation formalized by Bouchet which replaces the neighborhood of a chosen vertex with its edge-complement. This operation induces an equivalence relation on graphs; determining the size of the resulting…

Combinatorics · Mathematics 2026-03-02 Nicholas Connolly , Shin Nishio , Kae Nemoto

This article is the author's contribution to the volume "Problems on mapping class groups and related topics" which will be published in December 2006, with Benson Farb as Editor. Various individuals were invited by Farb to submit open…

Geometric Topology · Mathematics 2007-05-23 Joan S. Birman

In 2009 Chmutov introduced the idea of partial duality for embeddings of graphs in surfaces. We discuss some alternative descriptions of partial duality, which demonstrate the symmetry between vertices and faces. One is in terms of band…

Combinatorics · Mathematics 2016-05-02 M. N. Ellingham , Xiaoya Zha

We explicitly construct new subgroups of the mapping class groups of an uncountable collection of infinite-type surfaces, including, but not limited to, free groups, Baumslag-Solitar groups, mapping class groups of other surfaces, and a…

Geometric Topology · Mathematics 2026-02-11 Carolyn R. Abbott , Hannah Hoganson , Marissa Loving , Priyam Patel , Rachel Skipper

Motivated by recent extensive studies on Wenger graphs, we introduce a new infinite class of bipartite graphs of the similar type, called linearized Wenger graphs. The spectrum, diameter and girth of these linearized Wenger graphs are…

Combinatorics · Mathematics 2014-12-02 Xiwang Cao , Mei Lu , Daqing Wan , Li-Ping Wang , Qiang Wang

We investigate the property of a spatial graph of having a leveled embedding and characterize the abstract graphs with this property. We show that all leveled embeddings are free and we compare leveled and paneled (also known as flat)…

Combinatorics · Mathematics 2025-09-22 Senja Barthel , Fabio Buccoliero

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

Graph embeddings, wherein the nodes of the graph are represented by points in a continuous space, are used in a broad range of Graph ML applications. The quality of such embeddings crucially depends on whether the geometry of the space…

Machine Learning · Statistics 2022-02-03 Francesco Di Giovanni , Giulia Luise , Michael Bronstein

We give a new approach to handling hypergraph regularity. This approach allows for vertex-by-vertex embedding into regular partitions of hypergraphs, and generalises to regular partitions of sparse hypergraphs. We also prove a corresponding…

Combinatorics · Mathematics 2019-01-18 Peter Allen , Ewan Davies , Jozef Skokan

A family of one-vertex triangulations of 3-manifolds, layered-triangulations, is defined. Layered-triangulations are first described for handlebodies and then extended to all 3-manifolds via Heegaard splittings. A complete and detailed…

Geometric Topology · Mathematics 2007-05-23 William Jaco , J. Hyam Rubinstein

This work deals with relations between a bounded cohomological invariant and the geometry of Hermitian symmetric spaces of noncompact type. The invariant, obtained from the K\"ahler class, is used to define and characterize a special class…

Differential Geometry · Mathematics 2007-05-23 Anna Wienhard

The loop graph of an infinite type surface is an infinite diameter hyperbolic graph first studied in detail by Juliette Bavard. An important open problem in the study of infinite type surfaces is to describe the boundary of the loop graph…

Geometric Topology · Mathematics 2022-06-03 Lvzhou Chen , Alexander J. Rasmussen

Whiteley \cite{wh} gives a complete characterization of the infinitesimal flexes of complete bipartite frameworks. Our work generalizes a specific infinitesimal flex to include joined graphs, a family of graphs that contain the complete…

Metric Geometry · Mathematics 2011-01-04 Timothy Sun , Chun Ye