https://ogma.newcastle.edu.au/vital/access/ /manager/Index ${session.getAttribute("locale")} 5 Incidence semirings of graphs and visible bases https://ogma.newcastle.edu.au/vital/access/ /manager/Repository/uon:18001 Wed 29 Apr 2020 13:48:58 AEST ]]> Distances of centroid sets in a graph-based construction for information security applications https://ogma.newcastle.edu.au/vital/access/ /manager/Repository/uon:28348 Wed 11 Apr 2018 13:20:27 AEST ]]> Matrix constructions of centroid sets for classification systems https://ogma.newcastle.edu.au/vital/access/ /manager/Repository/uon:29328 Sat 24 Mar 2018 07:34:23 AEDT ]]> Rees semigroups of digraphs for classification of data https://ogma.newcastle.edu.au/vital/access/ /manager/Repository/uon:23853 S of the Rees semigroup of a digraph and for every zero-divisor-free idempotent semiring F with identity element, our main theorem describes all ideals J in the semigroup semiring F₀[S] such that J has the largest possible weight.]]> Sat 24 Mar 2018 07:12:11 AEDT ]]>