相关论文: Voltage lifts of graphs from a category theory vie…
We present the theory of multifunctions applied to graphs. Its interesting feature is that walks are recognized as iterations. We consider the graphs with arbitrary number of vertices which are determined by multifunctions. The mutually…
We view hyper-graphs as incidence graphs, i.e. bipartite graphs with a set of nodes representing vertices and a set of nodes representing hyper-edges, with two nodes being adjacent if the corresponding vertex belongs to the corresponding…
In this paper we present $2$-category theory from the perspective of Gray-categories using the graphical calculus of separated surface diagrams. As an extended example we consider cones and limits of $2$-functors. Then we use the canonical…
We study some versions of the statement of Hadwiger's conjecture for finite as well as infinite graphs.
We invent the notion of a derived and fluid variety. Fluid variety has no proper derived variety as its subvariety. We examine some properties of fluid and derived varieties. Examples of such varieties of bands are presented.
It is not hard to find many complete bipartite graphs which are not determined by their spectra. We show that the graph obtained by deleting an edge from a complete bipartite graph is determined by its spectrum. We provide some graphs, each…
In work of Fokkinga and Meertens a calculational approach to category theory is developed. The scheme has many merits, but sacrifices useful type information in the move to an equational style of reasoning. By contrast, traditional proofs…
Category theory has foundational importance because it provides conceptual lenses to characterize what is important in mathematics. Originally the main lenses were universal mapping properties and natural transformations. In recent decades,…
We develop a homotopy theory of directed graphs based on cubical homotopy groups, also referred to as A-groups or reduced GLMY homotopy groups. Localizing the category of directed graphs at morphisms that induce isomorphisms on these groups…
Derivators, introduced independently by Grothendieck and Heller in the 1980s, provide a categorical framework for studying homotopy theory. They are based on the idea that, while the homotopy 1-category of a single model category or…
The Graded Classification Conjecture (GCC) states that the pointed $K_0^{\operatorname{gr}}$-group is a complete invariant of the Leavitt path algebras of finite graphs when these algebras are considered with their natural grading by…
Lifts of categorical diagrams $D\colon\mathsf{J}\to\mathsf{X}$ against discrete opfibrations $\pi\colon\mathsf{E}\to\mathsf{X}$ can be interpreted as presenting solutions to systems of equations. With this interpretation in mind, it is…
We develop a comprehensive string diagrammatic treatment of electrical circuits. Building on previous, limited case studies, we introduce controlled sources and meters as elements, and the impedance calculus, a powerful toolbox for…
We develop a theory to measure the variance and covariance of probability distributions defined on the nodes of a graph, which takes into account the distance between nodes. Our approach generalizes the usual (co)variance to the setting of…
To any directed graph we associate an algebra with edges of the graph as generators and with relations defined by all pairs of directed paths with the same origin and terminus. Such algebras are related to factorizations of polynomials over…
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…
The two graphs of the title both have vertex set G. In the intersection power graph, x and y are joined if some non-identity element is a power of both; in the power graph, x and y joined if one is a power of the other. Thus the power graph…
A new approach of graph matching is introduced in this paper, which efficiently solves the problem of graph isomorphism and subgraph isomorphism. In this paper we are introducing a new approach called SubGraD, for query graph detection in…
A graceful difference labeling (gdl for short) of a directed graph G with vertex set V is a bijection f between V and {1,...,|V|} such that, when each arc uv is assigned the difference label f(v)-f(u), the resulting arc labels are distinct.…
A graph theoretic perspective is taken for a range of phenomena in continuum physics in order to develop representations for analysis of large scale, high-fidelity solutions to these problems. Of interest are phenomena described by partial…