http://researchonline.federation.edu.au/vital/access/manager/Index ${session.getAttribute("locale")} 5 A highway-centric labeling approach for answering distance queries on large sparse graphs http://researchonline.federation.edu.au/vital/access/manager/Repository/vital:10717 Wed 07 Apr 2021 13:56:04 AEST ]]> Visual tools for analysing evolution, emergence, and error in data streams http://researchonline.federation.edu.au/vital/access/manager/Repository/vital:3599 Wed 07 Apr 2021 13:34:35 AEST ]]> Dynamic reconfiguration and graph theory approaches to failures in IT based telecommunication networks http://researchonline.federation.edu.au/vital/access/manager/Repository/vital:1527 Wed 07 Apr 2021 13:32:36 AEST ]]> Dynamic reconfiguration of telecommunication networks http://researchonline.federation.edu.au/vital/access/manager/Repository/vital:1339 Wed 07 Apr 2021 13:32:23 AEST ]]> Magic and antimagic labeling of graphs http://researchonline.federation.edu.au/vital/access/manager/Repository/vital:1077 Wed 07 Apr 2021 13:32:06 AEST ]]> HSAGA and its application for the construction of near-Moore digraphs http://researchonline.federation.edu.au/vital/access/manager/Repository/vital:871 Wed 07 Apr 2021 13:31:51 AEST ]]> On consecutive edge magic total labeling of graphs http://researchonline.federation.edu.au/vital/access/manager/Repository/vital:845 Wed 07 Apr 2021 13:31:50 AEST ]]> A framework for monitoring progress and planning teaching towards the effective use of computer algebra systems http://researchonline.federation.edu.au/vital/access/manager/Repository/vital:711 Wed 07 Apr 2021 13:31:40 AEST ]]> On mixed Moore graphs http://researchonline.federation.edu.au/vital/access/manager/Repository/vital:656 Wed 07 Apr 2021 13:31:37 AEST ]]> Graphs of order two less than the Moore bound http://researchonline.federation.edu.au/vital/access/manager/Repository/vital:603 1 and k>1. Similarly, the Moore bound for an undirected graph of maximum degree d and diameter k is . Undirected Moore graphs only exist in a small number of cases. Mixed (or partially directed) Moore graphs generalize both undirected and directed Moore graphs. In this paper, we shall show that all known mixed Moore graphs of diameter k=2 are unique and that mixed Moore graphs of diameter k3 do not exist.]]> Wed 07 Apr 2021 13:31:33 AEST ]]> Two new families of large compound graphs http://researchonline.federation.edu.au/vital/access/manager/Repository/vital:559 Wed 07 Apr 2021 13:31:29 AEST ]]> All (k;g)-cages are k-edge-connected http://researchonline.federation.edu.au/vital/access/manager/Repository/vital:524 Wed 07 Apr 2021 13:31:27 AEST ]]> All (k;g)-cages are edge-superconnected http://researchonline.federation.edu.au/vital/access/manager/Repository/vital:523 Wed 07 Apr 2021 13:31:27 AEST ]]> On the connectivity of (k, g)-cages of even girth http://researchonline.federation.edu.au/vital/access/manager/Repository/vital:521 Wed 07 Apr 2021 13:31:27 AEST ]]> Characterization of eccentric digraphs http://researchonline.federation.edu.au/vital/access/manager/Repository/vital:332 Wed 07 Apr 2021 13:31:13 AEST ]]> A sum labelling for the generalised friendship graph http://researchonline.federation.edu.au/vital/access/manager/Repository/vital:279 Wed 07 Apr 2021 13:31:09 AEST ]]> Complete characterization of almost moore digraphs of degree three http://researchonline.federation.edu.au/vital/access/manager/Repository/vital:101 Wed 07 Apr 2021 13:30:55 AEST ]]> Enumerations of vertex orders of almost Moore digraphs with selfrepeats http://researchonline.federation.edu.au/vital/access/manager/Repository/vital:100 1, diameter k > 1 is a diregular digraph with the number of vertices one less than the Moore bound. If G is an almost Moore digraph, then for each vertex u ∈ V (G) there exists a vertex v ∈ V (G), called repeat of u and denoted by r (u) = v, such that there are two walks of length ≤ k from u to v. The smallest positive integer p such that the composition rp (u) = u is called the order of u. If the order of u is 1 then u is called a selfrepeat. It is known that if G is an almost Moore digraph of diameter k ≥ 3 then G contains exactly k selfrepeats or none. In this paper, we propose an exact formula for the number of all vertex orders in an almost Moore digraph G containing selfrepeats, based on the vertex orders of the out-neighbours of any selfrepeat vertex. © 2007 Elsevier B.V. All rights reserved.]]> Wed 07 Apr 2021 13:30:55 AEST ]]> A lower bound on the order of regular graphs with given girth pair http://researchonline.federation.edu.au/vital/access/manager/Repository/vital:94 Wed 07 Apr 2021 13:30:55 AEST ]]> Consecutive magic graphs http://researchonline.federation.edu.au/vital/access/manager/Repository/vital:93 Wed 07 Apr 2021 13:30:54 AEST ]]> On the degrees of a strongly vertex-magic graph http://researchonline.federation.edu.au/vital/access/manager/Repository/vital:92 Wed 07 Apr 2021 13:30:54 AEST ]]>