https://ogma.newcastle.edu.au/vital/access/ /manager/Index ${session.getAttribute("locale")} 5 On the vertex irregular total labeling for subdivision of trees https://ogma.newcastle.edu.au/vital/access/ /manager/Repository/uon:43331 Thu 15 Sep 2022 14:57:41 AEST ]]> Complete characterization of almost Moore digraphs of degree three https://ogma.newcastle.edu.au/vital/access/ /manager/Repository/uon:68 Sat 24 Mar 2018 07:42:02 AEDT ]]> Construction techniques for digraphs with minimum diameter https://ogma.newcastle.edu.au/vital/access/ /manager/Repository/uon:23800 order/degree problem, that is, to determine the smallest diameter of a digraph given order and maximum out-degree. There is no general efficient algorithm known for the construction of such optimal digraphs but various construction techniques for digraphs with minimum diameter have been proposed. In this paper, we survey the known techniques.]]> Fri 06 Oct 2023 15:41:42 AEDT ]]>