Related papers: A bracket polynomial for graphs, IV. Undirected Eu…
A graph is k-linked if any k disjoint vertex-pairs can be joined by k disjoint paths. We improve a lower bound on the linkedness of polytopes slightly, which results in exact values for the minimal linkedness of 7-, 10- and 13-dimensional…
It is now well known that ultracontractive properties of semigroups with infinitesimal generator given by an undirected graph Laplacian operator can be obtained through an understanding of the geometry of the underlying infinite weighted…
In this paper we introduce a graded bracket of forms on multicontact manifolds. This bracket satisfies a graded Jacobi identity as well as two different versions of the Leibniz rule, one of them being a weak Leibniz rule, extending the…
The simple connected graphs may be classified by their cycle composition (number and lengths of cycles). This work derives the counting series of the simple connected graphs that have cycles of unrestricted number and length, but no…
In this paper, for each graph $G$, we def\mbox{}ine a chain complex of graded modules over the ring of polynomials, whose graded Euler characteristic is equal to the chromatic polynomial of $G$. Furthermore, we def\mbox{}ine a chain complex…
The dynamics of coupled intermittent maps is used to model the correlated structure of genomic sequences. The use of intermittent maps, as opposed to other simple chaotic maps, is particularly suited for the production of long range…
I compute several terms of the asymptotic expansion of the number of connected labelled graphs with n nodes and m edges, for small k=m-n.
We describe q-analogues of the 4-vertices in the Spin(4)-recoupling theory introduced by Barrett and Crane in gr-qc/9709028 using Kauffman-Lins SU(2)-recoupling theory in each factor and generalize them to obtain operators with the symmetry…
Recently, Dasbach, Futer, Kalfagianni, Lin, and Stoltzfus extended the notion of a Tait graph by associating a set of ribbon graphs (or equivalently, embedded graphs) to a link diagram. Here we focus on Seifert graphs, which are the ribbon…
In this paper, we continue our study of closed models defined in categories of graphs. We construct a closed model defined in the cat-egory of directed graphs which characterizes the strongly connected components. This last notion has many…
Representing various networked data as multiplex networks, networks of networks and other multilayer networks can reveal completely new types of structures in these system. We introduce a general and principled graphlet framework for…
A matrix-weighted graph is an undirected graph with a $k\times k$ positive semidefinite matrix assigned to each edge. There are natural generalizations of the Laplacian and adjacency matrices for such graphs. These matrices can be used to…
We characterise the structure of those graphs of a given order which maximise the number of connected induced subgraphs for seven different graph classes, each with other prescribed parameters like minimum degree, independence number,…
We extend the Penrose polynomial, originally defined only for plane graphs, to graphs embedded in arbitrary surfaces. Considering this Penrose polynomial of embedded graphs leads to new identities and relations for the Penrose polynomial…
The Burling sequence is a sequence of triangle-free graphs of unbounded chromatic number. The class of Burling graphs consists of all the induced subgraphs of the graphs of this sequence. In the first and second parts of this work, we…
We study a class of graphs that represent local independence structures in stochastic processes allowing for correlated error processes. Several graphs may encode the same local independencies and we characterize such equivalence classes of…
Tittmann, Averbouch and Makowsky [P. Tittmann, I. Averbouch, J.A. Makowsky, The enumeration of vertex induced subgraphs with respect to the number of components, European Journal of Combinatorics, 32 (2011) 954-974], introduced the subgraph…
Graph neural networks are prominent models for representation learning over graph-structured data. While the capabilities and limitations of these models are well-understood for simple graphs, our understanding remains incomplete in the…
We construct a graph G such that any embedding of G into R^{3} contains a nonsplit link of two components, where at least one of the components is a nontrivial knot. Further, for any m < n we produce a graph H so that every embedding of H…
Recently, Gross, Mansour, and Tucker introduced the partial Petrial polynomial, which enumerates all partial Petrials of a ribbon graph by Euler genus. They provided formulas or recursions for various families of ribbon graphs, including…