Related papers: A generalization of higher rank graphs

We give two generalizations of Kac's Theorem on representations of quivers. One is to representations of equipped graphs by relations, in the sense of Gelfand and Ponomarev. The other is to representations of quivers in which certain of the…

Interval and proper interval graphs are very well-known graph classes, for which there is a wide literature. As a consequence, some generalizations of interval graphs have been proposed, in which graphs in general are expressed in terms of…

In this work, we will introduce the notion of generalized topological groups using generalized topological structure and generalized continuity defined by ?A. Cs?asz?ar [2]. We will discuss some basic properties of this kind of structures…

Associating graph algebras to directed graphs leads to both covariant and contravariant functors from suitable categories of graphs to the category k-Alg of algebras and algebra homomorphisms. As both functors are often used at the same…

The goal of this paper is to show that fundamental concepts in higher-order Fourier analysis can be nauturally extended to the non-commutative setting. We generalize Gowers norms to arbitrary compact non-commutative groups. On the…

Higher rank graphs, also known as $k$-graphs, are a $k$-dimensional generalization of directed graphs and a rich source of examples of $C^*$-algebras. In the present paper, we contribute to the geometric classification program for $k$-graph…

The aim of this paper is to present a few versions of the Riemann-Hurwitz formula for a regular branched covering of graphs. By a graph, we mean a finite connected multigraph. The genus of a graph is defined as the rank of the first…

We define a natural class of graphs by generalizing prior notions of visibility, allowing the representing regions and sightlines to be arbitrary. We consider mainly the case of compact connected representing regions, proving two results…

In a previous paper I gave a presentation for the Quillen higher algebraic K-groups of an exact category in terms of "acyclic binary multicomplexes". In this paper I take that presentation as a definition of the higher K-groups, generalize…

The rank of a graph is defined to be the rank of its adjacency matrix. A graph is called reduced if it has no isolated vertices and no two vertices with the same set of neighbors. A reduced graph $G$ is said to be maximal if any reduced…

We introduce classes of graphs with bounded expansion as a generalization of both proper minor closed classes and degree bounded classes. Such classes are based on a new invariant, the greatest reduced average density (grad) of G with rank…

A graph $G$ is said to be a $k$-degenerate graph if any subgraph of $G$ contains a vertex of degree at most $k$. Let $\kappa$ be any non-negative function on the vertex set of $G$. We first define a $\kappa$-degenerate graph. Next we give…

In this note, we investigate fundamental relations between exploration processes in random graphs, and branching processes. We formulate a class of models that we call {\em rank-$k$ random graphs}, and that are special in that their…

This paper proposes a family of permutation-invariant graph embeddings, generalizing the Skew Spectrum of graphs of Kondor & Borgwardt (2008). Grounded in group theory and harmonic analysis, our method introduces a new class of graph…

Generalized connectivity introduced by Hager (1985) has been studied extensively in undirected graphs and become an established area in undirected graph theory. For connectivity problems, directed graphs can be considered as generalizations…

A $k$-ranking of a graph $G$ is a labeling of its vertices from $\{1,\ldots,k\}$ such that any nontrivial path whose endpoints have the same label contains a larger label. The least $k$ for which $G$ has a $k$-ranking is the ranking number…

In this paper we introduce a notion of {\it generalized operad} containing as special cases various kinds of operad--like objects: ordinary, cyclic, modular, properads etc. We then construct inner cohomomorphism objects in their categories…

Network-based modeling of complex systems and data using the language of graphs has become an essential topic across a range of different disciplines. Arguably, this graph-based perspective derives its success from the relative simplicity…

It is proved that for a vector space W, any set of parafermion-like vertex operators on W in a certain canonical way generates a generalized vertex algebra in the sense of [DL2] with W as a natural module. This result generalizes a result…

In this paper, we define a number of closely related isomorphisms. On one side of these isomorphisms sit a number of of algebras generalizing the Hecke and affine Hecke algebras, which we call the "Hecke family"; on the other, we find…