Related papers: A Shorter Proof of the Transitivity of Transfinite…
A temporal graph is a graph whose edges only appear at certain points in time. Reachability in these graphs is defined in terms of paths that traverse the edges in chronological order (temporal paths). This form of reachability is neither…
One must add arrows which are forced by transitivity to form the transitive closure of a directed graph. We introduce a construction of a transitive directed graph which is formed by adding vertices instead of arrows and which preserves the…
A new approach to find all the transitive orientations for a comparability graph (finite or infinite) is presented. This approach is based on the link between the notion of ``strong'' partitive set and the forcing theory (notions of…
This paper proposes that common measures for network transitivity, based on the enumeration of transitive triples, do not reflect the theoretical statements about transitivity they aim to describe. These statements are often formulated as…
We investigate the structure of connected graphs, not necessarily locally finite, with infinitely many ends. On the one hand we study end-transitive such graphs and on the other hand we study such graphs with the property that the…
We study transitivity properties of graphs with more than one end. We completely classify the distance-transitive such graphs and, for all $k \geq 3$, the $k$-CS-transitive such graphs.
In this paper, we introduce a generalized concept of vertex transitivity in graphs called generalized vertex transitivity. We put forward a new invariant called transitivity number of a graph. The value of this invariant in different…
In this paper, we present some new results describing connections between the spectrum of a regular graph and its generalized connectivity, toughness, and the existence of spanning trees with bounded degree.
We characterise all vertex-transitive finite connected graphs as essentially 5-connected or on a short list of explicit graph-classes. Our proof heavily uses Tutte-type canonical decompositions.
The fully dynamic transitive closure problem asks to maintain reachability information in a directed graph between arbitrary pairs of vertices, while the graph undergoes a sequence of edge insertions and deletions. The problem has been…
Simple and shorter proofs of two Dirac-type theorems involving connectivity are presented.
Short cycles connectivity is a generalization of ordinary connectivity. Instead by a path (sequence of edges), two vertices have to be connected by a sequence of short cycles, in which two adjacent cycles have at least one common vertex. If…
In this work, we explore edge direction, transitivity, and connectedness of Cayley graphs of gyrogroups. More specifically, we find conditions for a Cayley graph of a gyrogroup to be undirected, transitive, and connected. We also show a…
Redundancy needs more precise characterization as it is a major factor in the evolution and robustness of networks of multivariate interactions. We investigate the complexity of such interactions by inferring a connection transitivity that…
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…
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.
We revisit results obtained in [F. Harary, U. Peled, Hamiltonian threshold graphs, Discrete Appl.~Math., 16 (1987), 11--15], where several necessary and necessary and sufficient conditions for a connected threshold graph to be Hamiltonian…
Bounds are proved for the connective constant \mu\ of an infinite, connected, \Delta-regular graph G. The main result is that \mu\ \ge \sqrt{\Delta-1} if G is vertex-transitive and simple. This inequality is proved subject to weaker…
We show that if a graph is k-edge-connected, and we adjoin to it another graph satisfying a "contracted diameter less or equal to 2" condition, with minimal degree greater or equal to k, and some natural hypothesis on the edges connecting…
There are several different common definitions of a property in topological dynamics called "topological transitivity," and it is part of the folklore of dynamical systems that under reasonable hypotheses, they are equivalent. Various…