Related papers: Cameron-Liebler sets in Hamming graphs
Representations of color Hom-Lie algebras are reviewed, and it is shown that there exist a series of coboundary operators. We also introduce the notion of a color omni-Hom-Lie algebra associated to a vector space and an even invertible…
In this paper, we will show dichotomy theorems for the computation of polynomials corresponding to evaluation of graph homomorphisms in Valiant's model. We are given a fixed graph $H$ and want to find all graphs, from some graph class,…
We introduce orbital graphs and discuss some of their basic properties. Then we focus on their usefulness for search algorithms for permutation groups, including finding the intersection of groups and the stabilizer of sets in a group.
Aim of this paper is to define a new type of cohomology for multiplicative Hom-Leibniz algebras which controls deformations of Hom-Leibniz algebra structure. The cohomology and the associated deformation theory for Hom-Leibniz algebras as…
We present new combinatorial insights into the calculation of (Castelnuovo-Mumford) regularity of graphs.
In this paper, we extend the ideas of graph pebbling to oriented graphs and find a classification for all graphs with fully traversable pebbling assignments that are isomorphic to their assignment graph. We then give some cases in which a…
The Hilbert functions of sets of distinct points in P^n have been characterized. We show that if we restrict to sets of distinct of points in P^{n_1} x ... x P^{n_k} that are also arithmetically Cohen-Macaulay (ACM for short), then there is…
We introduce a remarkable subset "the stem" of the set of positive roots of a reduced root system. The stem determines several interesting decompositions of the corresponding reductive Lie algebra. It gives also a nice simple three…
We develop a new method for enumerating independent sets of a fixed size in general graphs, and we use this method to show that a conjecture of Engbers and Galvin holds for all but finitely many graphs. We also use our method to prove…
We construct explicit generating sets S_n and \tilde S_n of the for the alternating and the symmetric groups, which turn the Cayley graphs C(Alt(n), S_n) and C(Sym(n), \tilde S_n) into a family of bounded degree expanders for all n. This…
Graph embeddings deal with injective maps from a given simple, undirected graph $G=(V,E)$ into a metric space, such as $\mathbb{R}^n$ with the Euclidean metric. This concept is widely studied in computer science, see \cite{ge1}, but also…
We explore the concept of a graph homomorphism through the lens of C$^*$-algebras and operator systems. We start by studying the various notions of a quantum graph homomorphism and examine how they are related to each other. We then define…
Graphical models have been popularly used for capturing conditional independence structure in multivariate data, which are often built upon independent and identically distributed observations, limiting their applicability to complex…
The paper studies the structure of restricted hom-Lie algebras. More specifically speaking, we first give the equivalent definition of restricted hom-Lie algebras. Second, we obtain some properties of $p$-mappings and restrictable hom-Lie…
We study a recursively defined two-parameter family of graphs which generalize Fibonacci cubes and Pell graphs and determine their basic structural and enumerative properties. In particular, we show that all of them are induced subgraphs of…
We present a method for associating labeled directed graphs to finite-dimensional Lie algebras, thereby enabling rapid identification of key structural algebraic features. To formalize this approach, we introduce the concept of…
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 relativise the Thomassen--Woess definition of accessibility in graphs, defining what it means for a graph to be accessible relative to a peripheral system. In the case of locally finite, quasi-transitive graphs, we characterise relative…
In this article we study higher homological properties of $n$-levelled algebras and connect them to properties of the underlying graphs. Notably, to each $2$-representation-finite quadratic monomial algebra $\Lambda$ we associate a…
In this note we give a combinatorial characterization of all the unmixed bipartite graphs.