
In mathematics, a multiplicative graph (in French: graphe multiplicatif or neocategory in some English-language papers) is an algebraic structure in category theory. It is a generalization of an ordinary category in the sense that neither the associativity of arrow composition nor the composibility of a pair of connected arrows are assumed. While an ordinary category is a notion combining a directed graph and a monoidal structure, a multiplicative graph is a partial magma-like structure. Namely, it is a structure in one‑to‑one correspondence with the vertices of a directed graph, and each object has left and right identity morphisms, but composability is partial, and, moreover, associativity is not required.
Arrow composition in an ordinary category satisfies the following property: if arrows and connect in the sense that their composition is defined, and, moreover, and In a multiplicative graph, however, condition does not guarantee the existence of within that structure without further assumptions – but if this composition exists, it also satisfies and When drawing a diagram for a multiplicative graph, it is almost always necessary to explicitly draw all existing arrows that play a role in the argument. For example, as shown in Coppey (1980), square diagrams in a multiplicative graph can take one of five types depending on which potential compositions in the diagram are actually defined.
This notion first appears in Ehresmann's book Catégories et structures. The French school bases its definition of sketch on the notion of a multiplicative graph, because this definition required a category-like structure that avoided redundant axioms as much as possible. This structure is the multiplicative graph, and this is a type of relaxed notion of category, such as a semicategory.
Cury studied enriched multiplicative graph. As a more general notion, there is the compositional graph, and multiplicative graphs can be seen as strongly identitive compositional graphs.
| Total | Associative | Identity | Divisible | |
|---|---|---|---|---|
| Partial magma | Unneeded | Unneeded | Unneeded | Unneeded |
| Multiplicative | Unneeded | Unneeded | Required | Unneeded |
| Semigroupoid | Unneeded | Required | Unneeded | Unneeded |
| Small category | Unneeded | Required | Required | Unneeded |
| Groupoid | Unneeded | Required | Required | Required |
| Magma | Required | Unneeded | Unneeded | Unneeded |
| Quasigroup | Required | Unneeded | Unneeded | Required |
| Unital magma | Required | Unneeded | Required | Unneeded |
| Loop | Required | Unneeded | Required | Required |
| Semigroup | Required | Required | Unneeded | Unneeded |
| Associative quasigroup | Required | Required | Unneeded | Required |
| Monoid | Required | Required | Required | Unneeded |
| Group | Required | Required | Required | Required |
A multiplicative graph is couple formed by a set denoted by , and a partial law of composition on satisfying the following axioms:
From the condition 2, the reflexive graph is uniquely defined.
Let be a multiplicative graph, if one has a and (resp. and ), then we say that admit a right (resp. left) inverse of a morphism in . If there exists an , we say that in is invertible such that is the right and left inverse of in , then we called an inverse of in . If is a multiplicative graph and if admit f' for right (resp. left) inverse in , one has:
and
While inverse morphisms in a ordinary category are unique, a morphisme of multiplicative graph can have several inverse morphisms. The law of composition are shown in the table below:

| f | f' | f'' | e | e' | |
| f | e' | e' | f | ||
| f' | e | f' | |||
| f'' | e | f'' | |||
| e | f' | f'' | e | ||
| e' | f | e' |
Let and be two multiplicative graph. A functor (Ehresmann called this a neofunctor. Since the functors between categories are ordinary functors, in this article, the functor between multiplicative graphs, we just write it as "functor" in italics.) from toward is a triple , where is a mapping from into such that for each and that:
If is defined in , then is defined in , and
We say also that is a functor; we write instead of and denotes the restriction of .
If and are two functors, we denote by , the functor from to assigning
to in .
An ordinary functor must preserve identity morphisms and composition of morphisms, but in a multiplicative graph, the composibility of a pair of connected morphisms is not assumed.[clarification needed]