相关论文: Edge-transitive embeddings of complete graphs

We classify the planar cubic Cayley graphs of connectivity 2, providing an explicit presentation and embedding for each of them. Combined with [9] this yields a complete description of all planar cubic Cayley graphs.

The subdivision graph $S(\Sigma)$ of a connected graph $\Sigma$ is constructed by adding a vertex in the middle of each edge. In a previous paper written with Cheryl E. Praeger, we characterised the graphs $\Sigma$ such that $S(\Sigma)$ is…

We classify graphs that are 0, 1, or 2 edges short of being complete partite graphs with respect to intrinsic linking and intrinsic knotting. In addition, we classify intrinsic knotting of graphs on 8 vertices. For graphs in these families,…

This research focuses on analyzing the depth of generalized binomial edge ideals. We extend the notion of $d$-compatible map for the pairs of a complete graph and an arbitrary graph, and using it, we give a combinatorial lower bound for the…

In this paper, we introduce the concept of complementary edge ideals of graphs and study their algebraic properties and invariants.

Knowledge graphs (KGs) of real-world facts about entities and their relationships are useful resources for a variety of natural language processing tasks. However, because knowledge graphs are typically incomplete, it is useful to perform…

The problem of finding the general classification of geodetic graphs is still open. We believe that one of the obstacles to attain this goal is that geodetic graphs lack a structural description. In other words, their fundamental properties…

We present new conditions that eliminate a large class of graphs from being induced neighbourhoods of finite vertex-transitive graphs.

A class $\mathcal{G}$ of graphs is hereditary if it is closed under taking induced subgraphs. We investigate the edge-add class, $\mathcal{G}^{\mathrm{add}}$, consisting of graphs that can be made members of $\mathcal{G}$ by adding at most…

Inspired by work of Fr\"oberg (1990), and Eagon and Reiner (1998), we define the \emph{total $k$-cut complex} of a graph $G$ to be the simplicial complex whose facets are the complements of independent sets of size $k$ in $G$. We study the…

Graph is an important data representation which appears in a wide diversity of real-world scenarios. Effective graph analytics provides users a deeper understanding of what is behind the data, and thus can benefit a lot of useful…

We introduce the family of $k$-gap-planar graphs for $k \geq 0$, i.e., graphs that have a drawing in which each crossing is assigned to one of the two involved edges and each edge is assigned at most $k$ of its crossings. This definition is…

We propose a new Graph Neural Network that combines recent advancements in the field. We give theoretical contributions by proving that the model is strictly more general than the Graph Isomorphism Network and the Gated Graph Neural…

We present, to the best of the authors' knowledge, all known results for the (planar) crossing numbers of specific graphs and graph families. The results are separated into various categories; specifically, results for general graph…

Simple drawings are drawings of graphs in which any two edges intersect at most once (either at a common endpoint or a proper crossing), and no edge intersects itself. We analyze several characteristics of simple drawings of complete…

This paper studies a class of binomial ideals associated to graphs with finite vertex sets. They generalize the binomial edge ideals, and they arise in the study of conditional independence ideals. A Gr\"obner basis can be computed by…

A new infinite family of bipartite cubic 3-arc transitive graphs is constructed and studied. They provide the first known examples admitting a 2-arc transitive vertex-biquasiprimitive group of automorphisms for which the index two subgroup…

A graph is edge-primitive if its automorphism group acts primitively on the edge set. In this short paper, we prove that a finite 2-arc-transitive edge-primitive graph has almost simple automorphism group if it is neither a cycle nor a…

A set of vertices of a graph is distinguishing if the only automorphism that preserves it is the identity. The minimal size of such sets, if they exist, is the distinguishing cost. The distinguishing costs of vertex transitive cubic graphs…

We argue that Transformers are essentially graph-to-graph models, with sequences just being a special case. Attention weights are functionally equivalent to graph edges. Our Graph-to-Graph Transformer architecture makes this ability…