
Sprout graphs are finite directed graphs matured over a finite subset of the non-negative time line. A simple undirected connected graph on at least two vertices is required to construct an infant graph to mature from. The maxi-max arc-weight principle and the maxi-min arc-weight principle are introduced in the paper. These principles are used to determine the maximum and minimum maturity weight of a sprout graph.
16 pages
infant graph, index pattern, [MATH] Mathematics [math], maturity weight, directed graph, [MATH.MATH-CO] Mathematics [math]/Combinatorics [math.CO], sprout graph, FOS: Mathematics, Mathematics - Combinatorics, arc weight, Combinatorics (math.CO), Sprouting
infant graph, index pattern, [MATH] Mathematics [math], maturity weight, directed graph, [MATH.MATH-CO] Mathematics [math]/Combinatorics [math.CO], sprout graph, FOS: Mathematics, Mathematics - Combinatorics, arc weight, Combinatorics (math.CO), Sprouting
| citations This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 0 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Average | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Average | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
