Related papers: Characterization of Circular-arc Graphs: II. McCon…
The $c_2$ invariant is an arithmetic graph invariant introduced by Schnetz and developed by Brown and Schnetz in order to better understand Feynman integrals. This document looks at the special case where the graph in question is a…
Grid intersection graphs are the intersection graphs of vertical and horizontal segments in the plane. When the bottom and respectively left endpoints of the vertical and horizontals segments belong to a line with negative slope, the graph…
A graph is an opposition graph, respectively, a coalition graph, if it admits an acyclic orientation which puts the two end-edges of every chordless 4-vertex path in opposition, respectively, in the same direction. Opposition and coalition…
A kernel of a directed graph is a subset of vertices that is both independent and absorbing (every vertex not in the kernel has an out-neighbour in the kernel). Not all directed graphs contain kernels, and computing a kernel or deciding…
A cograph is a simple graph that contains no induced path on four vertices. In this paper, we consider $\mathcal{C}$-graphs, which are a specific class of cographs, defined as $$\overline{\overline{\overline{K_{\alpha_{1}}}\cup…
A distinguishing index of a (di)graph is the minimum number of colours in an edge (or arc) colouring such that the identity is the only automorphism that preserves that colouring. We investigate the minimum and maximum value of the…
We study $c$-crossing-critical graphs, which are the minimal graphs that require at least $c$ edge-crossings when drawn in the plane. For $c=1$ there are only two such graphs without degree-2 vertices, $K_5$ and $K_{3,3}$, but for any fixed…
The graph reconstruction conjecture states that all graphs on at least three vertices are determined up to isomorphism by their deck. In this paper, a general framework for this problem is proposed to simply explain the reconstruction of…
A $p$-improper interval graph is an interval graph that has an interval representation in which no interval contains more than $p$ other intervals. A critical $p$-improper interval graph is $p-1$ improper when any vertex is removed. In this…
In this paper, we introduce two local graph features for missing link prediction tasks on ogbl-citation2. We define the features as Circle Features, which are borrowed from the concept of circle of friends. We propose the detailed computing…
In this paper we investigate the structure of flip graphs on non-crossing perfect matchings in the plane. Specifically, consider all non-crossing straight-line perfect matchings on a set of $2n$ points that are placed equidistantly on the…
The fractional and circular chromatic numbers are the two most studied non-integral refinements of the chromatic number of a graph. Starting from the definition of a coloring base of a graph, which originated in work related to ergodic…
We explicitly construct a minimal free resolution of the cover ideals of clique-whiskered graphs. In particular, Cohen--Macaulay chordal graphs, clique corona graphs, and Cohen--Macaulay Cameron--Walker graphs are examples of…
Mock threshold graphs are a simple generalization of threshold graphs that, like threshold graphs, are perfect graphs. Our main theorem is a characterization of mock threshold graphs by forbidden induced subgraphs. Other theorems…
Common models for random graphs, such as Erd\H{o}s-R\'{e}nyi and Kronecker graphs, correspond to generating random adjacency matrices where each entry is non-zero based on a large matrix of probabilities. Generating an instance of a random…
This is the second of a series of papers which aim towards a classification of edge-transitive maps of which the Euler characteristic and the edge number are coprime. This one carries out the classification work for arc-transitive maps with…
We show an improved parallel algorithm for decomposing an undirected unweighted graph into small diameter pieces with a small fraction of the edges in between. These decompositions form critical subroutines in a number of graph algorithms.…
The commuting graph of a group $G$ is the graph whose vertices are the elements of $G$, two distinct vertices joined if they commute. Our purpose in this paper is twofold: we discuss the computational problem of deciding whether a given…
Determining whether two graphs are isomorphic is a fundamental problem with practical applications in areas such as molecular chemistry or social network analysis, yet it remains a challenging task, with exact solutions often being…
Graphs are useful to interpret widely used image processing methods, e.g., bilateral filtering, or to develop new ones, e.g., kernel based techniques. However, simple graph constructions are often used, where edge weight and connectivity…