Related papers: On 2-arc-transitive graphs of product action type
In this paper, we explore the design and analysis of regular bipartite graphs motivated by their application in low-density parity-check (LDPC) codes specifically with constrained girth and in the high-rate regime. We focus on the relation…
Let $n$ and $k$ be integers with $n> k\geq1$ and $[n] = \{1, 2, ... , n\} $. The $bipartite \ Kneser \ graph$ $H(n, k)$ is the graph with the all $k$-element and all ($n-k$)-element subsets of $[n] $ as vertices, and there is an edge…
The class of 2-interval graphs has been introduced for modelling scheduling and allocation problems, and more recently for specific bioinformatic problems. Some of those applications imply restrictions on the 2-interval graphs, and justify…
A graph is {\em near-bipartite} if its vertex set can be partitioned into an independent set and a set that induces a forest. It is clear that near-bipartite graphs are $3$-colorable. In this note, we show that planar graphs without cycles…
In a bidirected graph an edge has a direction at each end, so bidirected graphs generalize directed graphs. We generalize the definitions of transitive closure and transitive reduction from directed graphs to bidirected graphs by…
We discuss various types of Tits Alternative for subgroups of graph products of groups, and prove that, under some natural conditions, a graph product of groups satisfies a given form of Tits Alternative if and only if each vertex group…
In this paper we show a correspondence between directed graphs and bipartite undirected graphs with a perfect matching, that allows to study properties of directed graphs through the properties of the corresponding undirected graphs. In…
This paper proposes an efficient method to construct the bipartite graph with as many edges as possible while without introducing the shortest cycles of length equal to 4. The binary matrix associated with the bipartite graph described…
We show that real tight frames that generate lattices must be rational, and use this observation to describe a construction of lattices from vertex transitive graphs. In the case of irreducible group frames, we show that the corresponding…
A bipartite graph is chordal bipartite if every cycle of length at least six contains a chord. We determine the minimum size in 2-connected chordal bipartite graphs with given order.
We give necessary and sufficient conditions for lobe-transitivity of locally finite and locally countable graphs whose connectivity equals 1. We show further that, given any biconnected graph $\Lambda$ and a "code" assigned to each orbit of…
Noncrossing arc diagrams are combinatorial models for permutations that encode information about lattice congruences of the weak order and about the associated discrete geometry. In this paper, we consider two related, analogous models for…
In this expository paper, we present a motivated construction of large graphs not containing a given complete bipartite subgraph. The key insight is that the algebraic constructions yield very non-smooth probability distributions.
An alternative foundation for 2-categories is explored by studying graph-theoretically a partial operation on 2-cells named juncture, which can replace vertical and horizontal composition. Juncture is a generalized vertical composition of…
We study the behaviour of the 2-rank of the adjacency matrix of a graph under Seidel and Godsil-McKay switching, and apply the result to graphs coming from graphical Hadamard matrices of order $4^m$. Starting with graphs from known Hadamard…
The well-known cubic Allen-Cahn (AC) equation is a simple gradient dynamics (or variational) model for a nonconserved order parameter field. After revising main literature results for the occuring different types of moving fronts, we employ…
A surprising diversity of different products of hypergraphs have been discussed in the literature. Most of the hypergraph products can be viewed as generalizations of one of the four standard graph products. The most widely studied variant,…
Bipartite graphs model the relationship between two disjoint sets of objects. They have a wide range of applications and are often visualized as a 2-layered drawing, where each set of objects is visualized as a set of vertices (points) on…
In this paper we study graphs which admit acyclic orientations that contain a pair of arc-disjoint out-branching and in-branching (such an orientation is called good) and we focus on edge-minimal such graphs. A 2T-graph is a graph whose…
This paper presents graph theoretic conditions for the controllability and accessibility of bilinear systems over the special orthogonal group, the special linear group and the general linear group, respectively, in the presence of drift…