相关论文: Constructions of bipartite and bipartite-regular h…

Let $G$ a bipartite graph with vertex bipartition $\{A,B\}$ and let $m=|E(G)|$. An $(A,B)$-uniformly ordered labeling of $G$ is a labeling $f\colon V\rightarrow [0,2m]$ which, among other conditions, requires that there exists $\lambda\in…

We study biplane graphs drawn on a finite point set $S$ in the plane in general position. This is the family of geometric graphs whose vertex set is $S$ and which can be decomposed into two plane graphs. We show that every sufficiently…

For any abstract subfactor planar algebra $P$, there exists a finite index extremal subfactor $M_0 \subset M_1$ with $P$ as its standard invariant. In this paper, we classify the automorphism group of a bipartite graph planar algebra, and…

We give necessary and sufficient conditions for Riemannian maps to be biharmonic. We also define pseudo umbilical Riemannian maps as a generalization of pseudo-umbilical submanifolds and show that such Riemannian maps put some restrictions…

In this paper, we establish a couple of results on extremal problems in bipartite graphs. Firstly, we show that every sufficiently large bipartite graph with average degree $D$ and with $n$ vertices on each side has a balanced independent…

We study $M$-alternating Hamilton paths and $M$-alternating Hamilton cycles in a simple connected graph $G$ on $\nu$ vertices with a perfect matching $M$. Let $G$ be a bipartite graph, we prove that if for any two vertices $x$ and $y$ in…

In this paper we study the maximum value of the largest eigenvalue for simple bipartite graphs, where the number of edges is given and the number of vertices on each side of the bipartition is given. We state a conjectured solution, which…

We prove two sharp sufficient conditions for hamiltonian cycles in balanced bipartite directed graph. Let $D$ be a strongly connected balanced bipartite directed graph of order $2a$. Let $x,y$ be distinct vertices in $D$. $\{x,y\}$…

A graph is prime (with respect to the split decomposition) if its vertex set does not admit a partition (A,B) (called a split) with |A|, |B| >= 2 such that the set of edges joining A and B induces a complete bipartite graph. We prove that…

We consider a bipartite version of the color degree matrix problem. A bipartite graph $G(U,V,E)$ is half-regular if all vertices in $U$ have the same degree. We give necessary and sufficient conditions for a bipartite degree matrix (also…

A graph with vertex set V and edge set E is called a (d,c)-expander if the maximum degree of a vertex is d and, for every subset W of V that has cardinality at most |V|/2, the number of edges between vertices in W and vertices outside of W…

In [{Structural properties and decomposition of linear balanced matrices}, {\it Mathematical Programming}, 55:129--168, 1992], Conforti and Rao conjectured that every balanced bipartite graph contains an edge that is not the unique chord of…

Graph partitioning, or the dividing of a graph into two or more parts based on certain conditions, arises naturally throughout discrete mathematics, and problems of this kind have been studied extensively. In the 1990s, Ando conjectured…

A regular bipartite tournament is an orientation of a complete balanced bipartite graph $K_{2n,2n}$ where every vertex has its in- and outdegree both equal to $n$. In 1981, Jackson conjectured that any regular bipartite tournament can be…

It was recently shown \cite{STV} that satisfiability is polynomially solvable when the incidence graph is an interval bipartite graph (an interval graph turned into a bipartite graph by omitting all edges within each partite set). Here we…

In this article, we extend several algebraic graph analysis methods to bipartite networks. In various areas of science, engineering and commerce, many types of information can be represented as networks, and thus the discipline of network…

A hypergraph is said to be $1$-Sperner if for every two hyperedges the smallest of their two set differences is of size one. We present several applications of $1$-Sperner hypergraphs and their structure to graphs. In particular, we…

We present an algorithm for determining whether a bipartite graph $G$ is 2-chordal (formerly doubly chordal bipartite). At its core this algorithm is an extension of the existing efficient algorithm for determining whether a graph is…

In the present paper, we show that many combinatorial and topological objects, such as maps, hypermaps, three-dimensional pavings, constellations and branched coverings of the two--sphere admit any given finite automorphism group. This…

Connectedness and bipartiteness are basic properties of classical graphs, and the purpose of this paper is to investigate the case of quantum graphs. We introduce the notion of connectedness and bipartiteness of quantum graphs in terms of…