Related papers: On graph equivalences preserved under extensions
Hyperfiniteness or amenability of measurable equivalence relations and group actions has been studied for almost fifty years. Recently, unexpected applications of hyperfiniteness were found in computer science in the context of testability…
Signed graphs are studied since the middle of the last century. Recently, the notion of homomorphism of signed graphs has been introduced since this notion captures a number of well known conjectures which can be reformulated using the…
We focus on evolution equations on co-evolving, infinite, graphs and establish a rigorous link with a class of nonlinear continuity equations, whose vector fields depend on the graphs considered. More precisely, weak solutions of the…
We prove a general inclusion-exclusion relation for the extended chromatic symmetric function of a weighted graph, which specializes to (extended) $k$-deletion, and we give two methods to obtain numerous new bases from weighted graphs for…
We consider symmetric powers of a graph. In particular, we show that the spectra of the symmetric square of strongly regular graphs with the same parameters are equal. We also provide some bounds on the spectra of the symmetric squares of…
Graph is an abstract representation commonly used to model networked systems and structure. In problems across various fields, including computer vision and pattern recognition, and neuroscience, graphs are often brought into comparison (a…
How can the `affinity' or `strength' of ties of a random graph be characterized and compactly represented? How can concepts like Fourier and inverse-Fourier like transform be developed for graph data? To do so, we introduce a new…
Assume that $G$ is a finite group. For every $a, b \in\mathbb N,$ we define a graph $\Gamma_{a,b}(G)$ whose vertices correspond to the elements of $G^a\cup G^b$ and in which two tuples $(x_1,\dots,x_a)$ and $(y_1,\dots,y_b)$ are adjacent if…
We study linkedness of Cartesian product of graphs and prove that the product of an $a$-linked and a $b$-linked graphs is $(a+b-1)$-linked if the graphs are sufficiently large. Further bounds in terms of connectivity are shown. We determine…
We consider {\em L-graphs}, that is contact graphs of axis-aligned L-shapes in the plane, all with the same rotation. We provide several characterizations of L-graphs, drawing connections to Schnyder realizers and canonical orders of…
A list assignment $L$ for a graph $G$ is an $(\ell,k)$-list assignment if $|L(v)|\geq \ell$ for each $v \in V(G)$ and $|L(u) \cap L(v)| \leq k$ for each $uv \in E(G)$. We say $G$ is $(\ell,k)$-choosable if it admits an $L$-colouring for…
The aim of this paper is to derive on the basis of the Euler's formula several analytical relations which hold for certain classes of planar graphs and which can be useful in algorithmic graph theory.
A mixed extension of a graph $G$ is a graph $H$ obtained from $G$ by replacing each vertex of $G$ by a clique or a coclique, where vertices of $H$ coming from different vertices of $G$ are adjacent if and only if the original vertices are…
We describe proper correspondences from graph C*-algebras to arbitrary C*-algebras by K-theoretic data. If the target C*-algebra is a graph C*-algebra as well, we may lift an isomorphism on a certain invariant to correspondences back and…
We define a special case of tree decompositions for planar graphs that respect a given embedding of the graph. We study the analogous width of the resulting decomposition we call the embedded-width of a plane graph. We show both upper…
We raise some questions about graph polynomials, highlighting concepts and phenomena that may merit consideration in the development of a general theory. Our questions are mainly of three types: When do graph polynomials have reduction…
A graph $X$ is said to be a pattern polynomial graph if its adjacency algebra is a coherent algebra. In this study we will find a necessary and sufficient condition for a graph to be a pattern polynomial graph. Some of the properties of the…
Let $G$ be a connected graph. If $G$ contains a matching of size $k$, and every matching of size $k$ is contained in a perfect matching of $G$, then $G$ is said to be \emph{$k$-extendable}. A $k$-regular spanning subgraph of $G$ is called a…
We formulate the notion of an isomorphism of GKM graphs. We then show that two GKM graphs have isomorphic graph equivariant cohomology algebras if and only if the graphs are isomorphic.
A graph $G$ is $1$-extendible if every edge belongs to at least one $1$-factor of $G$. Let $G$ be a graph with a $1$-factor $F$. Then an even $F$-orientation of $G$ is an orientation in which each $F$-alternating cycle has exactly an even…