相关论文: Voltage lifts of graphs from a category theory vie…
In this dissertation, we explore the structure of inversion graphs of permutations--a class of graphs that naturally arises by representing each permutation as a graph, where vertices correspond to entries and edges encode inversions.…
We investigate properties of $\mathbb{Z}_p$-towers of graph coverings that arise from a constant voltage assignment. We prove the existence and uniqueness (up to isomorphisms) of such towers. Furthermore, we study the Iwasawa invariants of…
In the context of infinity categories, we rethink the notion of derived functor in terms of correspondences. This is especially convenient for the description of a passage from an adjoint pair (F,G) of functors to a derived adjoint pair…
A variety is a category of ordered (finitary) algebras presented by inequations between terms. We characterize categories enriched over the category of posets which are equivalent to a variety. This is quite analogous to Lawvere's classical…
We describe recent achievements in the theory of weight systems, which are functions on chord diagrams satisfying so-called $4$-term relations. Our main attention is devoted to constructions of weight systems. The two main sources of these…
We describe various path homology theories constructed for a directed hypergraph. We introduce the category of directed hypergraphs and the notion of a homotopy in this category. Also, we investigate the functoriality and the homotopy…
In this paper, we give a classification of all Mengerian $4$-uniform hypergraphs derived from graphs.
Handwritten circuit diagrams from educational scenarios or historic sources usually exist on analogue media. For deriving their functional principles or flaws automatically, they need to be digitized, extracting their electrical graph.…
We prove that the invariably generating graph of a finite group can have an arbitrarily large number of connected components with at least two vertices.
The theory of graphons has proven to be a powerful tool in many areas of graph theory. In this paper, we introduce several foundational aspects of the theory of digraphons -- asymmetric two-variable functions that arise as limits of…
The degree sequence of a graph is a numerical method to characterize the properties of graphs. Generalized forms of degree sequences exist for complete graphs and complete graphs. Nikolopolus et al. characterized the number of spanning…
We classify Brauer graph algebras up to derived equivalence by showing that the set of derived invariants introduced by Antipov is complete. These algebras first appeared in representation theory of finite groups and can be defined for any…
We present a method to derive the complete spectrum of the lift $\Gamma^\alpha$ of a base digraph $\Gamma$, with voltage assignments on a (finite) group $G$. The method is based on assigning to $\Gamma$ a quotient-like matrix whose entries…
Graph theory is a promising approach in handling the problem of estimating the connectivity probability of vehicular ad-hoc networks (VANETs). With a communication network represented as graph, graph connectivity indicators become valid for…
We introduce a linearized version of group field theory. It can be viewed either as a group field theory over the additive group of a vector space or as an asymptotic expansion of any group field theory around the unit group element. We…
A subset of vertices is called a dissociation set if it induces a subgraph with vertex degree at most one. Recently, Yuan et al. established the upper bound of the maximum number of dissociation sets among all connected graphs of order n…
Working in any model theoretic structure, we single out a class of definable bipartite graphs that admit definable, close to perfect matchings. We use this result to prove a strengthening of Tarski's theorem for the definable setting.
It is known that given a directed graph E and a subset X of vertices, the sum of the projections associated to the vertices in X in the C*-algebra of E converges strictly in the multiplier algebra to a projection P. Here we give a…
In this note we propose an $\omega$-operadical way to prove the existence of the $\omega$-graph of the $\omega$-graphs and the reflexive $\omega$- graph of the reflexive $\omega$-graphs.
The periodic discrete Toda equation defined over finite fields has been studied. We obtained the finite graph structures constructed by the network of states where edges denote possible time evolutions. We simplify the graphs by introducing…