相关论文: Constructive Characterization of Critical Bipartit…

Directed graphs have long been used to gain understanding of the structure of semigroups, and recently the structure of directed graph semigroups has been investigated resulting in a characterization theorem and an analog of Fruct's…

Comparability graphs are a popular class of graphs. We introduce as the digraph analogue of comparability graphs the class of comparability digraphs. We show that many concepts such as implication classes and the knotting graph for a…

We introduce a notion of quantum function, and develop a compositional framework for finite quantum set theory based on a 2-category of quantum sets and quantum functions. We use this framework to formulate a 2-categorical theory of quantum…

It has long been known that the combinatorial properties of a graph $\Gamma$ are closely related to the group theoretic properties of its right angled artin group (raag). It's natural to ask if the graph homomorphisms are similarly related…

It is known that the canonical double cover of any connected nonbipartite graph have an automorphism group of the form $H \rtimes \mathbb{Z}_2$, where $H$ is the set of automorphism which preserve bipartite parts. We construct connected…

Lov\'asz (1967) showed that two finite relational structures A and B are isomorphic if, and only if, the number of homomorphisms from C to A is the same as the number of homomorphisms from C to B for any finite structure C. Soon after,…

We study the problem of graph clustering where the goal is to partition a graph into clusters, i.e. disjoint subsets of vertices, such that each cluster is well connected internally while sparsely connected to the rest of the graph. In…

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…

Given a graph G, a real orthogonal representation of G is a function from its set of vertices to R^d such that two vertices are mapped to orthogonal vectors if and only if they are not neighbors. The minimum vector rank of a graph is the…

By using Ocneanu's result on the classification of all irreducible connections on the Dynkin diagrams, we show that the dual principal graphs as well as the fusion rules of bimodules arising from any Goodman-de la Harpe-Jones subfactors are…

This paper summarizes substantive new results derived by a student team (the first three authors) under the direction of the fourth author at the 2005 session of the KSU REU ``Brainstorming and Barnstorming''. The main results are a…

A graph $G$ of order $n$ is said to be $k$-factor-critical for integers $1\leq k < n$, if the removal of any $k$ vertices results in a graph with a perfect matching. $1$- and $2$-factor-critical graphs are the well-known factor-critical and…

A fundamental theorem of Wilson states that, for every graph $F$, every sufficiently large $F$-divisible clique has an $F$-decomposition. Here a graph $G$ is $F$-divisible if $e(F)$ divides $e(G)$ and the greatest common divisor of the…

In a disk graph, every vertex corresponds to a disk in $\mathbb{R}^2$ and two vertices are connected by an edge whenever the two corresponding disks intersect. Disk graphs form an important class of geometric intersection graphs, which…

In this paper, we consider the problem of computing an optimal matching in a bipartite graph where elements of one side of the bipartition specify preferences over the other side, and one or both sides can have capacities and…

The computational complexity of multicut-like problems may vary significantly depending on whether the terminals are fixed or not. In this work we present a comprehensive study of this phenomenon in two types of cut problems in directed…

Let $G$ be a simple graph with order $n$ and adjacency matrix $\mathbf{A}(G)$. Let $\phi(G; \lambda)=\det(\lambda I-\mathbf{A}(G))=\sum_{i=0}^n\mathbf{a}_i(G)\lambda^{n-i}$ be the characteristic polynomial of $G$, where $\mathbf{a}_i(G)$ is…

Bipartite Correlation clustering is the problem of generating a set of disjoint bi-cliques on a set of nodes while minimizing the symmetric difference to a bipartite input graph. The number or size of the output clusters is not constrained…

We use crystals of tableaux and descent compositions to understand the decomposition of Schur functions $s_\lambda$ into Gessel's fundamental quasisymmetric functions $F_\alpha$. The connected crystal of tableaux $B(\lambda)$, associated to…

We revisit the concept of minimal rigidity as applied to soft repulsive, frictionless sphere packings in two-dimensions with the introduction of the jamming graph. Minimal rigidity is a purely combinatorial property encoded via Laman's…