Related papers: Cohen-Macaulay graphs arising from digraphs
The isomorphism problem of Cayley graphs has been well studied in the literature, such as characterizations of CI (DCI)-graphs and CI (DCI)-groups. In this paper, we generalize these to vertex-transitive graphs and establish parallel…
In a randomly oriented graph containing vertices $x$ and $y$, denote by $\{x\to y\}$ the event that there is a directed path from $x$ to $y$. We study the correlation between the events $\{x\to y\}$ and $\{y\to z\}$ for a (large) oriented…
The graphical notion of effective resistance has found wide-ranging applications in many areas of pure mathematics, applied mathematics and control theory. By the nature of its construction, effective resistance can only be computed in…
We introduce a homotopy theory of digraphs (directed graphs) and prove its basic properties, including the relations to the homology theory of digraphs constructed by the authors in previous papers. In particular, we prove the homotopy…
We prove a conjecture of Fox, Huang, and Lee that characterizes directed graphs that have constant density in all tournaments: they are disjoint unions of trees that are each constructed in a certain recursive way.
We classify the Cohen-Macaulay weighted oriented graphs whose underlying graphs have girth at least $5$.
In an earlier paper the first two authors have shown that self-complementary graphs can always be oriented in such a way that the union of the oriented version and its isomorphically oriented complement gives a transitive tournament. We…
Topological drawings are natural representations of graphs in the plane, where vertices are represented by points, and edges by curves connecting the points. Topological drawings of complete graphs and of complete bipartite graphs have been…
This paper initiates a systematic study of connections between undirected colored graphs and associated two-variable stable polynomials obtained via Cauchy transform-type formulas. Examples of such stable polynomials have played crucial…
We characterize Cohen-Macaulay posets of dimension two; they are precisely the shellable and strongly connected posets of dimension two. We also give a combinatorial description of these posets. Using the fact that co-comparability graph of…
In this paper, we investigate normal trees of directed graphs, which extend the fundamental concept of normal trees of undirected graphs. We prove that a directed graph $D$ has a normal spanning tree if and only if the topological space…
In this research paper, weighted / unweighted, directed / undirected graphs are associated with interesting Discrete Time Markov Chains (DTMCs) as well as Continuous Time Markov Chains (CTMCs). The equilibrium / transient behaviour of such…
In this paper we study the structure of $k$-transitive closures of directed paths and formulate several properties. Concept of $k$-transitive orientation generalize the traditional concept of transitive orientation of a graph.
Comparability graphs are the undirected graphs whose edges can be directed so that the resulting directed graph is transitive. They are related to posets and have applications in scheduling theory. This paper considers the problem of…
We expand on some invariants used for classifying nonselfadjoint operator algebras. Specifically to nonselfadjoint operator algebras which have a conditional expectation onto a commutative diagonal we construct an edge-colored directed…
We show that the total variation mixing time is not quasi-isometry invariant, even for Cayley graphs. Namely, we construct a sequence of pairs of Cayley graphs with maps between them that twist the metric in a bounded way, while the ratio…
We call a finite undirected graph minimally k-matchable if it has at least k distinct perfect matchings but deleting any edge results in a graph which has not. An odd subdivision of some graph G is any graph obtained by replacing every edge…
We introduce and study analogues of expander and hyperfinite graph sequences in the context of directed acyclic graphs, which we call "extender" and "hypershallow" graph sequences, respectively. Our main result is a probabilistic…
In this article, we characterize all unmixed and Cohen-Macaulay parity binomial edge ideals of cactus and chordal graphs in terms of the structural properties of the graph.
A graph is vertex-transitive if its automorphism group acts transitively on vertices of the graph. A vertex-transitive graph is a Cayley graph if its automorphism group contains a subgroup acting regularly on its vertices. In this paper,…