Related papers: A characterization of two-dimensional Buchsbaum ma…

A matching M is a dominating induced matching of a graph, if every edge of the graph is either in $M$ or has a common end-vertex with exactly one edge in $M$. The concept of complete dominating induced matching is introduced as graphs where…

This paper is about a small combinatorial trick, which is well known, but has no name. Let G be a permutation group acting on a vector space M. There is a natural way to assign a cosimplicial space to these data. We call the resulting…

Unigraphs are graphs identifiable up to isomorphism from their degree sequences. Given a class $\mathcal{A}$ of graphs, we define the class of $\mathcal{A}$-unigraphs to be graphs identifiable from degree sequence and membership in…

We introduce and study elementary properties of graph homology of algebras. This new homology theory shares many features of cyclic and Hochschild homology. We also define a graph K-theory together with an analog of Chern character.

Let V be a holomorphic bundle over a complex manifold M, and s be a holomorphic section of V. We study different types of cohomology associated to the Koszul complex induced by s. When M is complete, these cohomologies are isomorphic to…

Given a graph $G$, the graph $[G]$ obtained by adding, for each pair of vertices of $G$, a unique vertex adjacent to both vertices is called the binding graph of $G$. In this work, we show that the class of binding graphs is…

The power graph $\mathscr{P}(G)$ of a group $G$ is defined as the simple graph with vertex set $G$, and where two distinct vertices $x$ and $y$ are joined by an edge if and only if either $x= y^k$ or $y= x^k$, $k \in \mathbb{N}$. Here we…

A (complete) matching of the cells of a triangulated manifold can be thought as a combinatorial or discrete version of a nonsingular vector field. We give several methods for constructing such matchings.

We show that if the group of holomorphic automorphisms of a connected complex manifold $M$ of dimension $n$ is isomorphic as a topological group equipped with the compact-open topology to the automorphism group of the unit ball…

Let $G$ be a finite simple graph on a vertex set $V(G)=\{x_{11}, \ldots, x_{n1}\}$. Also let $m_1, \ldots,m_n \geq 2$ be integers and $G_1, \ldots, G_n$ be connected simple graphs on the vertex sets $V(G_i)=\{x_{i1}, \ldots, x_{im_i}\}$. In…

A complex unit gain graph is a simple graph in which each orientation of an edge is given a complex number with modulus 1 and its inverse is assigned to the opposite orientation of the edge. In this article, first we establish bounds for…

Suppose $G$ is a connected complex Lie group and $H$ is a closed complex subgroup such that $X := G/H$ is Kaehler and the codimension of the top non-vanishing homology group of $X$ with coefficients in $\mathbb Z_2$ is less than or equal to…

A connected graph $G$ with at least $2m + 2n + 2$ vertices which contains a perfect matching is $E(m, n)$-{\it extendable}, if for any two sets of disjoint independent edges $M$ and $N$ with $|M| = m$ and $|N|= n$, there is a perfect…

We characterize pure lexsegment complexes which are Cohen-Macaulay in arbitrary codimension. More precisely, we prove that any lexsegment complex is Cohen-Macaulay if and only if it is pure and its one dimensional links are connected, and,…

Let B be a finite collection of geometric (not necessarily convex) bodies in the plane. Clearly, this class of geometric objects naturally generalizes the class of disks, lines, ellipsoids, and even convex polygons. We consider geometric…

Let $M$ be a $G$-manifold and $\om$ a $G$-invariant exact $m$-form on $M$. We indicate when these data allow us to constract a cocycle on a group $G$ with values in the trivial $G$-module $\mathbb R$ and when this cocycle is nontrivial.

The acyclic matching number of a graph $G$ is the largest size of an acyclic matching in $G$, that is, a matching $M$ in $G$ such that the subgraph of $G$ induced by the vertices incident to an edge in $M$ is a forest. We show that the…

Graph classification plays an important role is data mining, and various methods have been developed recently for classifying graphs. In this paper, we propose a novel method for graph classification that is based on homotopy equivalence of…

The matching number of a graph G is the size of a maximum matching in the graph. In this note, we present a sufficient condition involving the matching number for the Hamiltonicity of graphs.

Given a group $G$ of automorphisms of a matroid $M$, we describe the representations of $G$ on the homology of the independence complex of the dual matroid $M^*$. These representations are related with the homology of the lattice of flats…