In graph theory|lang=en terms the difference between digraph and noneven
is that digraph is (graph theory) a directed graph while noneven is (graph theory) of a digraph, having no cycles of even weight.
As a noun digraph
is (graph theory) a directed graph or digraph can be (label) a two-character sequence used to enter a single conceptual character.
As an adjective noneven is
(rare|not comparable|of an integer) odd, not even.
digraph
English
Etymology 1
.
Noun
(
en noun)
(graph theory) A directed graph.
Hyponyms
* multidigraph
See also
(other terms of interest)
* adjacency matrix
* finite relation
* incidence matrix
* (Directed graph)
Etymology 2
From (etyl) .
Noun
(
en noun)
(label) A two-character sequence used to enter a single conceptual character.
(label) A pair of letters, especially a pair representing a single phoneme.
Hyponyms
* diphthong, ligature
noneven
English
Adjective
(
en adjective)
(rare, not comparable, of an integer) Odd, not even.
(rare) Uneven
(graph theory) Of a digraph, having no cycles of even weight
Derived terms
* nonevenly