Related papers: Higher Order Bipartiteness vs Bi-Partitioning in S…

Bispanning graphs are undirected graphs with an edge set that can be decomposed into two disjoint spanning trees. The operation of symmetrically swapping two edges between the trees, such that the result is a different pair of disjoint…

A square (0,1)-matrix X of order n > 0 is called fully indecomposable if there exists no integer k with 0 < k < n, such that X has a k by n-k zero submatrix. A stable set of a graph G is a subset of pairwise nonadjacent vertices. The…

We characterize the bipartite graphs that minimize the (first-degree based) entropy, among all bipartite graphs of given size, or given size and (upper bound on the) order. The extremal graphs turn out to be complete bipartite graphs, or…

A bipartite covering of a (multi)graph $G$ is a collection of bipartite graphs, so that each edge of $G$ belongs to at least one of them. The capacity of the covering is the sum of the numbers of vertices of these bipartite graphs. In this…

A bipartite graph $G=(L,R;E)$ with at least one edge is said to be identifiable if for every vertex $v\in L$, the subgraph induced by its non-neighbors has a matching of cardinality $|L|-1$. An $\ell$-subgraph of $G$ is an induced subgraph…

Graph invariants provide a powerful analytical tool for investigation of abstract structures of graphs. They, combined in convenient relations, carry global and general information about a graph and its various substructures such as cycle…

Let $k$ be a positive integer. Let $G$ be a balanced bipartite graph of order $2n$ with bipartition $(X, Y)$, and $S$ a subset of $X$. Suppose that every pair of nonadjacent vertices $(x,y)$ with $x\in S, y\in Y$ satisfies $d(x)+d(y)\geq…

A graph $G$ is a $(\Pi_A,\Pi_B)$-graph if $V(G)$ can be bipartitioned into $A$ and $B$ such that $G[A]$ satisfies property $\Pi_A$ and $G[B]$ satisfies property $\Pi_B$. The $(\Pi_{A},\Pi_{B})$-Recognition problem is to recognize whether a…

The graph packing problem is a well-known area in graph theory. We consider a bipartite version and give almost tight conditions on the packability of two bipartite sequences.

We prove that there is a constant $c >0$, such that whenever $p \ge n^{-c}$, with probability tending to 1 when $n$ goes to infinity, every maximum triangle-free subgraph of the random graph $G_{n,p}$ is bipartite. This answers a question…

Let $\mathbb{P}^s$ be the $s$-dimensional complex projective space, and let $X, Y$ be two non-empty open subsets of $\mathbb{P}^s$ in the Zariski topology. A hypersurface $H$ in $\mathbb{P}^s\times\mathbb{P}^s$ induces a bipartite graph $G$…

In this tutorial, we provide a didactic treatment of the emerging topic of signal processing on higher-order networks. Drawing analogies from discrete and graph signal processing, we introduce the building blocks for processing data on…

Simplicial complexes constitute the underlying topology of interacting complex systems including among the others brain and social interaction networks. They are generalized network structures that allow to go beyond the framework of…

We consider dataflow architecture for two classes of computations which admit taking linear combinations of execution runs: probabilistic sampling and generalized animation. We improve the earlier technique of almost continuous program…

Recently, Braunstein et al. [1] introduced normalized Laplacian matrices of graphs as density matrices in quantum mechanics and studied the relationships between quantum physical properties and graph theoretical properties of the underlying…

A graph $G = (V, E)$ is said to be word-representable if there exists a word $w$ over the alphabet $V$ such that, for any two distinct letters $x, y \in V$, the letters $x$ and $y$ alternate in $w$ if and only if $xy \in E$. A graph is…

A pseudo $(v,\, k,\, \la)$-design is a pair $(X, {\cal B})$ where $X$ is a $v$-set and ${\cal B}=\{B_1,...,B_{v-1}\}$ is a collection of $k$-subsets (blocks) of $X$ such that each two distinct $B_i, B_j$ intersect in $\la$ elements; and…

Mixed graphs can be seen as digraphs with arcs and edges (or digons, that is, two opposite arcs). In this paper, we consider the case where such graphs are bipartite and in which the undirected and directed degrees are one. The best graphs,…

Let $D$ be a strongly connected balanced bipartite directed graph of order $2a\geq 10$. Let $x,y$ be distinct vertices in $D$. $\{x,y\}$ dominates a vertex $z$ if $x\rightarrow z$ and $y\rightarrow z$; in this case, we call the pair…

The bipartition polynomial of a graph is a generalization of many other graph polynomials, including the domination, Ising, matching, independence, cut, and Euler polynomial. We show in this paper that it is also a powerful tool for proving…