Related papers: Aperiodicity Conditions in Topological $k$-Graphs
We introduce a generalisation of Condition (K) to finitely separated graphs and show that it is equivalent to essential freeness of the associated partial action as well as the exchange property of any of the associated tame algebras. As a…
For integers $k \geq 2$ and $n \geq k+1$, we prove the following: If $n\cdot k$ is even, there is a connected $k$-regular graph on $n$ vertices. If $n\cdot k$ is odd, there is a connected nearly $k$-regular graph on $n$ vertices.
Graph theory has provided a very useful tool, called topological indices which are a number obtained from the graph $G$ with the property that every graph $H$ isomorphic to $G$, value of a topological index must be same for both $G$ and…
A graph $G$ is $k$-path-coverable if its vertex set $V(G)$ can be covered by $k$ or fewer vertex disjoint paths. In this paper, using the $Q$-index of a connected graph $G$, we present a tight sufficient condition for $G$ with fixed minimum…
Let $G$ be a graph each edge $e$ of which is given a length $\ell(e)$. This naturally induces a distance $d_\ell(x,y)$ between any two vertices $x,y$, and we let $\ell-TOP$ denote the completion of the corresponding metric space. It turns…
A graph $G$ is $k$-edge-Hamiltonian if any collection of vertex-disjoint paths with at most $k$ edges altogether belong to a Hamiltonian cycle in $G$. A graph $G$ is $k$-Hamiltonian if for all $S\subseteq V(G)$ with $|S|\le k$, the subgraph…
We study conditions that ensure uniqueness theorems of Cuntz-Krieger type for relative Cuntz-Pimsner algebras $\mathcal{O}(J,X)$ associated to a $C^*$-correspondence $X$ over a $C^*$-algebra $A$. We give general sufficient conditions…
We give a combinatorial description of a family of 2-graphs which subsumes those described by Pask, Raeburn and Weaver. Each 2-graph $\Lambda$ we consider has an associated $C^*$-algebra, denoted $C^*(\Lambda)$, which is simple and purely…
Recent work of Lazarovich provides necessary and sufficient conditions on a graph L for there to exist a unique simply-connected (k,L)-complex. The two conditions are symmetry properties of the graph, namely star-transitivity and…
In this paper, we generalize the notions of perfect matchings, perfect 2-matchings to perfect k-matchings and give a necessary and sufficient condition for existence of perfect k-matchings. For bipartite graphs, we show that this k-matching…
A simple graph G is k-ordered (respectively, k-ordered hamiltonian) if, for any sequence of k distinct vertices v_1, ..., v_k of G, there exists a cycle (respectively, a hamiltonian cycle) in G containing these k vertices in the specified…
In this paper we unify several existing regularity conditions for graphs, including strong regularity, $k$-isoregularity, and the $t$-vertex condition. We develop an algebraic composition/decomposition theory of regularity conditions. Using…
We characterise quasidiagonality of the $C^*$-algebra of a cofinal $k$-graph in terms of an algebraic condition involving the coordinate matrices of the graph. This result covers all simple $k$-graph $C^*$-algebras. In the special case of…
A characterization is given for directed graphs that yield graph $C^*$-algebras with continuous trace. This is established for row-finite graphs with no sources first using a groupoid approach, and extended to the general case via the…
We give a simplified definition of topological T-duality that applies to arbitrary torus bundles. The new definition does not involve Chern classes or spectral sequences, only gerbes and morphisms between them. All the familiar topological…
The quest for optimal/stable paths in graphs has gained attention in a few practical or theoretical areas. To take part in this quest this chapter adopts an equilibrium-oriented approach that is abstract and general: it works with…
A graph $X$ is said to be unstable if the direct product $X\times K_2$ (also called the canonical double cover of $X$) has automorphisms that do not come from automorphisms of its factors $X$ and $K_2$. It is non-trivially unstable if it is…
We characterize some asymptotic properties of edge exchangeable random graphs in terms of the measure used to generate them. In particular, we give a necessary and sufficient condition for eventual forever connectedness, a sufficient…
We present a new, systematic approach for analyzing network topologies. We first introduce the dK-series of probability distributions specifying all degree correlations within d-sized subgraphs of a given graph G. Increasing values of d…
We carry the argument used in the proof of the Theorem of Denjoy over to the quasiperiodically forced case. Thus we derive that if a system of quasiperiodically forced circle diffeomorphisms with bounded variation of the derivative has no…