http://researchonline.federation.edu.au/vital/access/manager/Index ${session.getAttribute("locale")} 5 An open problem : (4; g)-cages with odd g <= 5 are tightly connected http://researchonline.federation.edu.au/vital/access/manager/Repository/vital:3625 = 5 are tightly superconnected. We present some partial results and the remaining open problems.]]> Wed 07 Apr 2021 13:34:37 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 ]]> Improved lower bound for the vertex connectivity of (delta;g)-cages http://researchonline.federation.edu.au/vital/access/manager/Repository/vital:522 = root(delta + 1) for g >= 7 odd. This result supports the conjecture of Fu, Huang and Rodger that all (delta; g)-cages are delta-connected. (c) 2005 Elsevier B.V. All rights reserved.]]> 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 ]]> 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 ]]> Diameter-sufficient conditions for a graph to be super-restricted connected http://researchonline.federation.edu.au/vital/access/manager/Repository/vital:95 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 ]]>