Johan Kok, Naduvath Sudev
Tshwane Metropolitan Police Department
City of Tshwane, SOUTH AFRICA
Department of Mathematics
Vidya Academy of Science & Technology
Thrissur, Kerala, INDIA

Abstract. 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 initially to construct an infant graph to mature from. The maxi-max arc-weight principle and the maxi-min arc-weight principle are introduced in this paper to determine the maximum and minimum maturity weight of a sprout graph. These principles demand more mathematical debates for logical closure. Since complete graphs, paths, stars and possibly cycles form part of the skeleton of all graphs, the introduction of results for these family of sprout graphs is expected to lay a good research foundation.

Received: September 14, 2015

AMS Subject Classification: 05C05, 05C20, 05C38, 05C62

Key Words and Phrases: sprouting, sprout graph, infant graph, directed graph, index pattern, arc weight, maturity weight

Download paper from here.

Google Scholar; DOI (International DOI Foundation); WorldCAT.

This work is licensed under the Creative Commons Attribution International License (CC BY).