Related papers: Vertex decomposability, shellability and Cohen-Mac…
Graph-structured data are an integral part of many application domains, including chemoinformatics, computational biology, neuroimaging, and social network analysis. Over the last two decades, numerous graph kernels, i.e. kernel functions…
Large-scale graphs are widely used to represent object relationships in many real world applications. The occurrence of large-scale graphs presents significant computational challenges to process, analyze, and extract information. Graph…
A new general decomposition theory inspired from modular graph decomposition is presented. This helps unifying modular decomposition on different structures, including (but not restricted to) graphs. Moreover, even in the case of graphs,…
Vertex deletion problems for graphs are studied intensely in classical and parameterized complexity theory. They ask whether we can delete at most k vertices from an input graph such that the resulting graph has a certain property.…
In this paper we explore the link between the theory of sheaves on graphs and noncommutative geometry showing that many concepts and constructions in the latter can be generalized and enhanced using methods coming from the former. They…
We investigate the shellability of the polyhedral join $\mathcal{Z}^*_M (K, L)$ of simplicial complexes $K, M$ and a subcomplex $L \subset K$. We give sufficient conditions and necessary conditions on $(K, L)$ for $\mathcal{Z}^*_M (K, L)$…
In this paper we study almost Cohen-Macaulay bipartite graphs. Furthermore, we prove that if $G$ is almost Cohen-Macaulay bipartite graph with at least one vertex of positive degree, then there is a vertex of $\deg(v) \leq 2$. In…
In this note we compute the cohomological obstruction to the existence of certain sheaves of vertex algebras on smooth varieties. These sheaves have been introduced and studied in the previous work by A.Vaintrob and two of the authors.…
In recent years, there has been a growing effort to develop effective and efficient algorithms for fake account detection in online social networks. This survey comprehensively reviews existing methods, with a focus on graph-based…
A combinatorial property that characterizes Cohen-Macaulay binomial edge ideals has long been elusive. A recent conjecture ties the Cohen-Macaulayness of a binomial edge ideal $J_G$ to special disconnecting sets of vertices of its…
We present some complexity results concerning the problems of covering a graph with $p$ convex sets and of partitioning a graph into $p$ convex sets. The following convexities are considered: digital convexity, monophonic convexity,…
Given a graph $G=(V,E)$, a subset $X$ of $V$ is an interval of $G$ provided that for any $a, b\in X$ and $ x\in V \setminus X$, $\{a,x\}\in E$ if and only if $\{b,x\}\in E$. For example, $\emptyset$, $\{x\}(x\in V)$ and $V$ are intervals of…
A vertex with neighbours of degrees $d_1 \geq ... \geq d_r$ has {\em vertex type} $(d_1, ..., d_r)$. A graph is {\em vertex-oblique} if each vertex has a distinct vertex-type. While no graph can have distinct degrees, Schreyer, Walther and…
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…
We introduce a new method for decomposing the edge set of a graph, and use it to replace the Regularity lemma of Szemer\'edi in some graph embedding problems. An algorithmic version is also given.
We consider Laplacians on $\Z^2$-periodic discrete graphs. The following results are obtained: 1) The Floquet-Bloch decomposition is constructed and basic properties are derived. 2) The estimates of the Lebesgue measure of the spectrum in…
Based on earlier work on regular quantum graphs we show that a large class of scaling quantum graphs with arbitrary topology are explicitly analytically solvable. This is surprising since quantum graphs are excellent models of quantum chaos…
In mathematics education research, mathematics task sets involving mixed practice include tasks from many different topics within the same assignment. In this paper, we use graph decompositions to construct mixed practice task sets for…
We study the depth of classes of binomial edge ideals and classify all closed graphs whose binomial edge ideal is Cohen--Macaulay.
We study a family of positive weighted well-covered graphs, which we call levelable graphs, that are related to a construction of level artinian rings in commutative algebra. A graph $G$ is levelable if there exists a weight function with…