相关论文: Chord Diagrams and Gauss Codes for Graphs

Perfect code in Cayley graphs and Cayley sum graphs is studied extensively in recent years. In this paper, we consider perfect code in generalized Cayley graphs.

Graph is a natural representation of data for a variety of real-word applications, such as knowledge graph mining, social network analysis and biological network comparison. For these applications, graph embedding is crucial as it provides…

We propose the Graph Space Embedding (GSE), a technique that maps the input into a space where interactions are implicitly encoded, with little computations required. We provide theoretical results on an optimal regime for the GSE, namely a…

In this paper, we propose a new type of graph, denoted as "embedded-graph", and its theory, which employs a distributed representation to describe the relations on the graph edges. Embedded-graphs can express linguistic and complicated…

The recent proliferation of publicly available graph-structured data has sparked an interest in machine learning algorithms for graph data. Since most traditional machine learning algorithms assume data to be tabular, embedding algorithms…

By adding or removing appropriate structures to Gauss diagram, one can create useful objects related to virtual links. In this paper few objects of this kind are studied: twisted virtual links generalizing virtual links; signed chord…

The definition of $1$-planar graphs naturally extends graph planarity, namely a graph is $1$-planar if it can be drawn in the plane with at most one crossing per edge. Unfortunately, while testing graph planarity is solvable in linear time,…

Neural embedding approaches have become a staple in the fields of computer vision, natural language processing, and more recently, graph analytics. Given the pervasive nature of these algorithms, the natural question becomes how to exploit…

While stabilizer tableaus have proven exceptionally useful as a descriptive tool for additive quantum codes, they offer little guidance for concrete constructions or coding algorithm analysis. We introduce a representation of stabilizer…

Graphs are a powerful data structure to represent relational data and are widely used to describe complex real-world data structures. Probabilistic Graphical Models (PGMs) have been well-developed in the past years to mathematically model…

In this work we investigate the chordality of squares and line graph squares of graphs. We prove a sufficient condition for the chordality of squares of graphs not containing induced cycles of length at least five. Moreover, we characterize…

A drawing in the plane ($\mathbb{R}^2$) of a graph $G=(V,E)$ equipped with a function $\gamma: V \rightarrow \mathbb{N}$ is \emph{$x$-bounded} if (i) $x(u) <x(v)$ whenever $\gamma(u)<\gamma(v)$ and (ii) $\gamma(u)\leq\gamma(w)\leq…

Embedding static graphs in low-dimensional vector spaces plays a key role in network analytics and inference, supporting applications like node classification, link prediction, and graph visualization. However, many real-world networks…

The study of graph drawings on 2-surfaces is an active area of mathematical research. Our main results are criteria for integer and modulo 2 embeddability of graphs to surfaces.

A graph is circle if its vertices are in correspondence with a family of chords in a circle in such a way that every two distinct vertices are adjacent if and only if the corresponding chords have nonempty intersection. Even though there…

Graph learning from data represents a canonical problem that has received substantial attention in the literature. However, insufficient work has been done in incorporating prior structural knowledge onto the learning of underlying…

Point-set embeddings and large-angle crossings are two areas of graph drawing that independently have received a lot of attention in the past few years. In this paper, we consider problems in the intersection of these two areas. Given the…

A classic application of description length is for model selection with the minimum description length (MDL) principle. The focus of this paper is to extend description length for data analysis beyond simple model selection and sequences of…

In this paper we study threshold coloring of graphs, where the vertex colors represented by integers are used to describe any spanning subgraph of the given graph as follows. Pairs of vertices with near colors imply the edge between them is…

Graph theory provides fundamental concepts for many fields of science like statistical physics, network analysis and theoretical computer science. Here we give a pedagogical introduction to graph theory, divided into three sections. In the…