Profile Image

Dr Joe Ryan

Senior Lecturer

School of Elect Engineering and Computer Science (Computer Science and Software Engineering)

Career Summary

Biography

I began lecturing at University of New England in 1990 and moved to University of Newcastle in 1992. I have been with the University of Newcastle since then except for a four period (2004 - 2008) when I was employed at University of Ballarat. In this time I have lectured for Schools of Mathematics, IT, Computer Science and Business. Research Expertise
I have publications and conference presentations in many areas of graph and network theory. In Graph Labeling I have written and spoken on magic and antimagic labelings; cases in which labels are placed on any one of, or combination of vertices, edges and faces and where weights are calculated on vertices, edges, faces and combinations of the previous. I have also interests in graceful, harmonious, cordial and felicitious labelings. I have many works on summable labelings which include sum, integral sum, mod sum, integral mod sum and sum* labelings. I co-authored the seminal paper on total irregular labelings which has produced many articles from researchers in Europe, India, China and Indonesia. Other interests in Graph Theory extend to extremal graphs - finding optimal graphs subject to constraints on parameters such as degree and diameter. I have worked on problems of this nature in both graphs and digraphs using tools such as voltage assignments, matrix analysis and repeat analysis. Recent efforts have seen this area of research expand into considering further constraints on underlying graphs. My work also overlaps into areas of hamiltonicity, Ramsey theory, algorithms, subgraph (forbidden and mandatory) and distance properties in which I have early results in eccentric digraphs. Other work involves combinatorics and encompasses combinatorics of finite sets, antichains and applications. In 2000 I coauthored a paper on The Train Marshalling Problem thus settling a problem of Knuth.

Teaching Expertise


Administrative Expertise


Collaborations
My primary research collaborators include, Mirka Miller, Yuqing Lin, Edy Tri Baskoro, Rinovia Simanjuntak, Kiki A. Sugeng, Paul Manuel, Zdenek Ryjacek, Martin Baca, Andrea Semanickova, Evelyne Flandrin, Camino Balbuena, and various PhD students

Qualifications

  • PhD, University of Newcastle
  • Bachelor of Mathematics (Honours), University of Wollongong

Keywords

  • Extremal Structures
  • Graph Labeling
  • Graph Theory
  • Network Topologies

Languages

  • English (Fluent)

Fields of Research

Code Description Percentage
080299 Computation Theory and Mathematics not elsewhere classified 100

Professional Experience

UON Appointment

Title Organisation / Department
Senior Lecturer University of Newcastle
School of Elect Engineering and Computer Science
Australia
Edit

Publications

For publications that are currently unpublished or in-press, details are shown in italics.


Journal article (52 outputs)

Year Citation Altmetrics Link
2016 Abawajy J, Kelarev AV, Miller M, Ryan J, 'Rees semigroups of digraphs for classification of data', Semigroup Forum, 92 121-134 (2016)

© 2014, Springer Science+Business Media New York.Recent research has motivated the investigation of the weights of ideals in semiring constructions based on semigroups. The prese... [more]

© 2014, Springer Science+Business Media New York.Recent research has motivated the investigation of the weights of ideals in semiring constructions based on semigroups. The present paper introduces Rees semigroups of directed graphs. This new construction is a common generalization of Rees matrix semigroups and incidence semigroups of digraphs. For each finite subsemigroup 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 F0[S] such that J has the largest possible weight.

DOI 10.1007/s00233-014-9685-x
2015 Baca M, Miller M, Phanalasy O, Ryan J, Semanicová-Fenovcíková A, Sillasen AA, 'Totally antimagic total graphs', Australasian Journal of Combinatorics, 61 42-56 (2015) [C1]

© 2014, University of Queensland. All rights reserved.For a graph G a bijection from the vertex set and the edge set of G to the set {1, 2, . . ., |V(G)| + |E(G)|} is called a to... [more]

© 2014, University of Queensland. All rights reserved.For a graph G a bijection from the vertex set and the edge set of G to the set {1, 2, . . ., |V(G)| + |E(G)|} is called a total labeling of G. The edge-weight of an edge is the sum of the label of the edge and the labels of the end vertices of that edge. The vertex-weight of a vertex is the sum of the label of the vertex and the labels of all the edges incident with that vertex. A total labeling is called edge-antimagic total (vertexantimagic total) if all edge-weights (vertex-weights) are pairwise distinct. If a labeling is simultaneously edge-antimagic total and vertex-antimagic total it is called a totally antimagic total labeling. A graph that admits totally antimagic total labeling is called a totally antimagic total graph.In this paper we deal with the problem of finding totally antimagic total labeling of some classes of graphs. We prove that paths, cycles, stars, double-stars and wheels are totally antimagic total. We also show that a union of regular totally antimagic total graphs is a totally antimagic total graph.

Citations Scopus - 1
2015 Holub P, Ryan JF, 'Degree diameter problem on triangular networks', Australasian Journal of Combinatorics, 63 333-345 (2015) [C1]
2015 Baca M, Phanalasy O, Ryan J, Semanicová-Fenovcíková A, 'Antimagic Labelings of Join Graphs', Mathematics in Computer Science, (2015) [C1]

An antimagic labeling of a graph with q edges is a bijection from the set of edges of the graph to the set of positive integers (Formula presented.) such that all vertex weights a... [more]

An antimagic labeling of a graph with q edges is a bijection from the set of edges of the graph to the set of positive integers (Formula presented.) such that all vertex weights are pairwise distinct, where a vertex weight is the sum of labels of all edges incident with the vertex. The join graph G + H of the graphs G and H is the graph with (Formula presented.) and (Formula presented.). The complete bipartite graph Km,n is an example of join graphs and we give an antimagic labeling for (Formula presented.). In this paper we also provide constructions of antimagic labelings of some complete multipartite graphs.

DOI 10.1007/s11786-015-0218-0
2015 RIZVI STR, KHALID M, ALI K, MILLER M, RYAN J, 'ON CYCLE-SUPERMAGICNESS OF SUBDIVIDED GRAPHS', Bulletin of the Australian Mathematical Society, (2015) [C1]

Lladó and Moragas [¿Cycle-magic graphs¿, Discrete Math. 307 (2007), 2925¿2933] showed the cyclic-magic and cyclic-supermagic behaviour of several classes of connected graphs. ... [more]

Lladó and Moragas [¿Cycle-magic graphs¿, Discrete Math. 307 (2007), 2925¿2933] showed the cyclic-magic and cyclic-supermagic behaviour of several classes of connected graphs. They discussed cycle-magic labellings of subdivided wheels and friendship graphs, but there are no further results on cycle-magic labellings of other families of subdivided graphs. In this paper, we find cycle-magic labellings for subdivided graphs. We show that if a graph has a cycle-(super)magic labelling, then its uniform subdivided graph also has a cycle-(super)magic labelling. We also discuss some cycle-supermagic labellings for nonuniform subdivided fans and triangular ladders.

DOI 10.1017/S0004972715000325
2015 Semanicová-Fenovcíková A, Baca M, Lascsáková M, Miller M, Ryan J, 'Wheels are Cycle-Antimagic', Electronic Notes in Discrete Mathematics, 48 11-18 (2015) [C1]

© 2015 Elsevier B.V.A simple graph G admits an H-covering if every edge in E(G) belongs to a subgraph of G isomorphic to H. An (a, d)-H-antimagic total labeling of a graph G admi... [more]

© 2015 Elsevier B.V.A simple graph G admits an H-covering if every edge in E(G) belongs to a subgraph of G isomorphic to H. An (a, d)-H-antimagic total labeling of a graph G admitting an H-covering is a bijective function from the vertex set V(G) and the edge set E(G) of the graph G onto the set of integers {1, 2, ..., |V(G)|+|E(G)|} such that for all subgraphs H' isomorphic to H, the sum of labels of all the edges and vertices belonging to H' constitute the arithmetic progression with the initial term a and the common difference d. Such a labeling is called super if the smallest possible labels appear on the vertices. In this paper, we investigate the existence of super cycle-antimagic total labelings of wheel.

DOI 10.1016/j.endm.2015.05.003
Citations Scopus - 1
2015 Abawajy J, Kelarev AV, Miller M, Ryan J, 'Distances of Centroid Sets in a Graph-Based Construction for Information Security Applications', Mathematics in Computer Science, (2015) [C1]

The aim of this paper is to prove that, for every balanced digraph, in every incidence semiring over a semifield, each centroid set J of the largest distance also has the largest ... [more]

The aim of this paper is to prove that, for every balanced digraph, in every incidence semiring over a semifield, each centroid set J of the largest distance also has the largest weight, and the distance of J is equal to its weight. This result is surprising and unexpected, because examples show that distances of arbitrary centroid sets in incidence semirings may be strictly less than their weights. The investigation of the distances of centroid sets in incidence semirings of digraphs has been motivated by the information security applications of centroid sets.

DOI 10.1007/s11786-015-0217-1
2015 Stephen S, Rajan B, Ryan J, Grigorious C, William A, 'Power domination in certain chemical structures', Journal of Discrete Algorithms, 33 10-18 (2015) [C1]

© 2014 Elsevier B.V.Let G(V,E) be a simple connected graph. A set S¿V is a power dominating set (PDS) of G, if every vertex and every edge in the system is observed following th... [more]

© 2014 Elsevier B.V.Let G(V,E) be a simple connected graph. A set S¿V is a power dominating set (PDS) of G, if every vertex and every edge in the system is observed following the observation rules of power system monitoring. The minimum cardinality of a PDS of a graph G is the power domination number ¿p(G). In this paper, we establish a fundamental result that would provide a lower bound for the power domination number of a graph. Further, we solve the power domination problem in polyphenylene dendrimers, Rhenium Trioxide (ReO3) lattices and silicate networks.

DOI 10.1016/j.jda.2014.12.003
2014 Feria-Purón R, Ryan J, Pérez-Rosés H, 'Searching for Large Multi-Loop Networks', Electronic Notes in Discrete Mathematics, 46 233-240 (2014) [C1]
DOI 10.1016/j.endm.2014.08.031
2014 Holub P, Miller M, Perez-Roses H, Ryan J, 'Degree diameter problem on honeycomb networks', DISCRETE APPLIED MATHEMATICS, 179 139-151 (2014) [C1]
DOI 10.1016/j.dam.2014.07.012
Citations Scopus - 1
2014 Arumugam S, Miller M, Phanalasy O, Ryan J, 'Antimagic labeling of generalized pyramid graphs', ACTA MATHEMATICA SINICA-ENGLISH SERIES, 30 283-290 (2014) [C1]
DOI 10.1007/s10114-014-2381-7
Citations Scopus - 1Web of Science - 1
2014 ABAWAJY J, KELAREV AV, MILLER M, RYAN J, 'Incidence Semirings of Graphs and Visible Bases', Bulletin of the Australian Mathematical Society, 89 451-459 (2014) [C1]
DOI 10.1017/S000497271300083X
Citations Scopus - 2Web of Science - 2
2014 Buset D, Miller M, Phanalasy O, Ryan J, 'Antimagicness for a family of generalized antiprism graphs', Electronic Journal of Graph Theory and Applications, 2 42-51 (2014) [C1]
DOI 10.5614/ejgta.2014.2.1.4
2013 Miller M, Ryan J, Ryjacek Z, Teska J, Vrana P, 'Stability of hereditary graph classes under closure operations', Journal of Graph Theory, 74 67-80 (2013) [C1]
DOI 10.1002/jgt.21692
2013 Miller M, Phanalasy O, Ryan J, Rylands L, 'Sparse graphs with vertex antimagic edge labelings', AKCE International Journal of Graphs and Combinatorics, 10 193-198 (2013) [C1]
Citations Scopus - 1
2013 Arumugam S, Baca M, Froncek D, Ryan J, Sugeng KA, 'Some open problems on graph labelings', AKCE International Journal of Graphs and Combinatorics, 10 237-243 (2013) [C1]
2013 Miller M, Ryan J, Ryjácek Z, 'Distance-locally disconnected graphs', Discussiones Mathematicae - Graph Theory, 33 203-215 (2013) [C1]

For an integer k = 1, we say that a (finite simple undirected) graph G is k-distance-locally disconnected, or simply k-locally disconnected if, for any x ¿ V (G), the set of vert... [more]

For an integer k = 1, we say that a (finite simple undirected) graph G is k-distance-locally disconnected, or simply k-locally disconnected if, for any x ¿ V (G), the set of vertices at distance at least 1 and at most k from x induces in G a disconnected graph. In this paper we study the asymptotic behavior of the number of edges of a k-locally disconnected graph on n vertices. For general graphs, we show that this number is I(n2) for any fixed value of k and, in the special case of regular graphs, we show that this asymptotic rate of growth cannot be achieved. For regular graphs, we give a general upper bound and we show its asymptotic sharpness for some values of k. We also discuss some connections with cages.

DOI 10.7151/dmgt.1657
2012 Miller M, Pérez-Rosés H, Ryan J, 'The Maximum Degree-and-Diameter-Bounded Subgraph in the Mesh', CoRR, abs/1203.4069 (2012)
2012 Miller M, Perez-Roses H, Ryan JF, 'The maximum degree and diameter-bounded subgraph in the mesh', Discrete Applied Mathematics, 160 1782-1790 (2012) [C1]
Citations Scopus - 3Web of Science - 1
2012 Miller M, Phanalasy O, Ryan JF, Rylands L, 'Antimagicness of some families of generalized graphs', Australasian Journal of Combinatorics, 53 179-190 (2012) [C1]
Citations Scopus - 1
2011 Sugeng KA, Ryan JF, 'Clique vertex magic cover of a graph', Mathematics in Computer Science, 5 113-118 (2011) [C1]
DOI 10.1007/s11786-011-0077-2
2011 Miller M, Rajan B, Ryan JF, 'Foreword', Mathematics in Computer Science, 5 1-2 (2011) [C3]
2011 Marshall KL, Miller M, Ryan JF, 'Extremal graphs without cycles of length 8 or less', Electronic Notes in Discrete Mathematics, 38 615-620 (2011) [C2]
DOI 10.1016/j.endm.2011.10.003
2011 Miller M, Phanalasy O, Ryan JF, 'All graphs have antimagic total labelings', Electronic Notes in Discrete Mathematics, 38 645-650 (2011) [C1]
Citations Scopus - 2
2011 Rylands L, Phanalasy O, Ryan JF, Miller M, 'Construction for antimagic generalized web graphs', AKCE International Journal of Graphs and Combinatorics, 8 141-149 (2011) [C1]
Citations Scopus - 1
2010 Maryati TK, Salman ANM, Baskoro ET, Ryan JF, Miller M, 'On H-supermagic labelings for certain shackles and amalgamations of a connected graph', Utilitas Mathematica, 83 333-342 (2010) [C1]
Citations Scopus - 12Web of Science - 6
2009 Delorme C, Flandrin E, Lin Y, Miller M, Ryan JF, 'On extremal graphs with bounded girth', Electronic Notes in Discrete Mathematics, 34 653-657 (2009) [C2]
DOI 10.1016/j.endm.2009.07.110
Citations Scopus - 1
Co-authors Yuqing Lin
2009 Kelarev A, Ryan JF, Yearwood J, 'Cayley graphs as classifiers for data mining: The influence of asymmetries', Discrete Mathematics, 309 5360-5369 (2009) [C1]
DOI 10.1016/j.disc.2008.11.030
Citations Scopus - 60Web of Science - 43
2009 Dafik, Miller M, Ryan JF, Baca M, 'On super (a, d)-edge-antimagic total labeling of disconnected graphs', Discrete Mathematics, 309 4909-4915 (2009) [C1]
DOI 10.1016/j.disc.2008.04.031
Citations Scopus - 9Web of Science - 1
2009 Baca M, Dafik, Miller M, Ryan J, 'Antimagic labeling of disjoint union of s-crowns', Utilitas Mathematica, 79 193-205 (2009) [C1]
Citations Scopus - 3Web of Science - 3
2009 Kelarev A, Ryan JF, Yearwood J, 'An algorithm for the optimization of multiple classifiers in data mining based on graphs', Journal of Combinatorial Mathematics and Combinatorial Computing, 71 65-85 (2009) [C1]
Citations Scopus - 1
2009 Sugeng KA, Froncek D, Miller M, Ryan JF, Walker J, 'On distance magic labeling of graphs', Journal of Combinatorial Mathematics and Combinatorial Computing, 71 39-48 (2009) [C1]
Citations Scopus - 10
2009 Arumugam S, Bloom GS, Miller M, Ryan JF, 'Some open problems on graph labelings', AKCE International Journal of Graphs and Combinatorics, 6 229-236 (2009) [C1]
2009 Ryan JF, 'Exclusive sum labeling of graphs: A survey', AKCE International Journal of Graphs and Combinatorics, 6 113-126 (2009) [C1]
2009 Arumugam S, Bloom GS, Bu C, Miller M, Rao SB, Ryan JF, 'Guest editors', AKCE International Journal of Graphs and Combinatorics, 6 (2009) [C2]
2009 Gimbert J, Lopez N, Miller M, Ryan JF, 'On the period and tail of sequences of iterated eccentric digraphs', Bulletin of the Institute of Combinatorics and its Applications, 56 19-32 (2009) [C1]
2008 Dafik, Miller M, Ryan JF, Baca M, 'Antimagic labeling of the union of two stars', The Australasian Journal of Combinatorics, 42 35-44 (2008) [C1]
Citations Scopus - 2
2008 Fernau H, Ryan J, Sugeng KA, 'A sum labelling for the generalised friendship graph', Discrete Mathematics, 308 734-740 (2008) [C1]
DOI 10.1016/j.disc.2007.07.059
Citations Scopus - 7Web of Science - 2
2007 Sugeng KA, Ryan J, 'On several classes of monographs', Australasian Journal of Combinatorics, 37 277-284 (2007) [C1]
2007 Baca M, Jendrol S, Miller M, Ryan J, 'On irregular total labellings', DISCRETE MATHEMATICS, 307 1378-1388 (2007) [C1]
DOI 10.1016/j.disc.2005.11.075
Citations Scopus - 82Web of Science - 46
2006 Baca M, Lin Y, Miller M, Ryan JF, 'Antimagic labelings of Mobius grids', Ars Combinatoria, 78 3-13 (2006) [C1]
Citations Scopus - 2Web of Science - 1
Co-authors Yuqing Lin
2006 Baca M, Baskoro ET, Miller M, Ryan J, Simanjuntak R, Sugeng KA, 'Survey of edge antimagic labelings of graphs', Majalah Ilmiah Himpunan Matematika Indonesia, 12 113-130 (2006) [C1]
2006 Gimbert J, Lopez N, Miller M, Ryan J, 'Characterization of eccentric digraphs', DISCRETE MATHEMATICS, 306 210-219 (2006) [C1]
DOI 10.1016/j.disc.2005.11.015
Citations Scopus - 9Web of Science - 2
2006 Balbuena C, Barker E, Das KC, Lin Y, Miller M, Ryan J, et al., 'On the degrees of a strongly vertex-magic graph', Discrete Mathematics, 306 539-551 (2006) [C1]
DOI 10.1016/j.disc.2006.01.019
Citations Scopus - 12Web of Science - 8
Co-authors Yuqing Lin
2004 Baca M, Jendrol S, Miller M, Ryan J, 'Antimagic labelings of generalized Petersen graphs that are plane', ARS COMBINATORIA, 73 115-128 (2004) [C1]
Citations Scopus - 17Web of Science - 10
2000 Miller M, Dahlhaus E, Horak P, Ryan JF, 'The train marshalling problem', Discrete Applied Mathematics, 103 41-54 (2000) [C1]
Citations Web of Science - 25
1999 Sutton MJ, Miller M, Ryan JF, Slamin, 'Connected graphs which are not mod sum graphs', Discrete Math, 195 287-293 (1999) [C1]
Citations Scopus - 11Web of Science - 8
1999 Miller M, Ryan JF, Slamin, 'Integral sum numbers of cocktail party graphs and symmetric complete bipartite graphs', Bulletin of ICA, 25 23-28 (1999) [C1]
1998 Brankovic L, Miller M, Plesnik J, Ryan J, Siran J, 'large graphs with small degree and diameter: A voltage assignment approach', Australian Journal of Combinatorics, 18 65-76 (1998) [C1]
Citations Scopus - 5
Co-authors Ljiljana Brankovic
1998 Miller M, Ryan J, Smyth W, 'The Sum Number of the Cocktail Party Graph', Bulletin of the ICA, 22 79-90 (1998) [C1]
1998 Miller M, Ryan JF, Smyth WF, Slamin, 'Labelling Wheels for Minimum Sum Number', Journal of Combinatorial Mathematics and Combinatorial Computing, 28 289-297 (1998) [C1]
1998 Brankovic L, Miller M, Plesnik J, Ryan J, Siran J, 'A note on constructing large Cayley graphs of given degree and diameter by voltage assignments', The Electronic Journal of Combinatorics, 5 1-11 (1998) [C1]
Citations Scopus - 12
Co-authors Ljiljana Brankovic
Show 49 more journal articles

Conference (11 outputs)

Year Citation Altmetrics Link
2013 Rylands L, Phanalasy O, Miller M, Ryan J, 'An application of completely separating systems to graph labeling', Combinatorial Algorithms: LNCS 8288 (2013) [E1]
DOI 10.1007/978-3-642-45278-9_32
Citations Scopus - 2
2013 Miller M, Baskoro ET, Slamin, Ryan J, 'Construction techniques for digraphs with minimum diameter', Combinatorial Algorithms: LNCS 8288 (2013) [E1]
DOI 10.1007/978-3-642-45278-9_28
Citations Scopus - 1
2011 Ryan JF, Phanalasy O, Miller M, Rylands L, 'On antimagic labeling for generalized web and flower graphs', Combinatorial Algorithms (2011) [E1]
DOI 10.1007/978-3-642-19222-7_31
Citations Scopus - 4Web of Science - 2
2003 Miller M, Ryan JF, Slamin, Sugeng KA, Tuga M, 'Open Problems in Exclusive Sum Labeling', Proceeding for AWOCA 2003 (2003) [E1]
2003 Miller M, Ryan JF, Smyth WF, 'The Sum Number of a Disjoint Union of Graphs', Proceedings for AWOCA 2003 (2003) [E1]
2002 Ryan JF, 'On Total Irregular Edge Strengths', Proceedings of the Thirteenth Australasian Workshop on Combinatorial Algorithms (2002) [E1]
2002 Miller M, Gimbert J, Ruskey F, Ryan J, 'Iterations of Eccentric Digraphs', Proceedings of the Thirteenth Australasian Workshop on Combinatorial Algorithms (2002) [E1]
2001 Baca M, Miller M, Ryan JF, 'On D-Antimagic Labellings of Prisms and Antiprisms', Proceedings of AWOCA 2001 (2001) [E1]
2001 Ryan J, Sutton M, Boland J, 'Generalised Petersen Graphs as Mode Graphs', Proceedings of the Twelfth Australian Workshop on Combinatorial Algorithms (2001) [E1]
2000 Dahlhaus E, Manne F, Miller M, Ryan JF, 'Algorithms for Combinatorial Problems Related to Train Marshalling', Proceedings of Eleventh Australasian Workshop on Combinatorial Algorithms (2000) [E1]
2000 Brankovic L, Ryan JF, 'Proceedings of the Eleventh Australasian Workshop on Combinatorial Algorithms', Proceedings of the Eleventh Australasian Workshop on Combinatorial Algorithms (2000) [E4]
Co-authors Ljiljana Brankovic
Show 8 more conferences
Edit

Grants and Funding

Summary

Number of grants 10
Total funding $78,989

Click on a grant title below to expand the full details for that specific grant.


20141 grants / $1,500

International Workshop on Optimal Network Topologies, Bratislava Slovakia, 30 June - 4 July 2014.$1,500

Funding body: University of Newcastle - Faculty of Engineering & Built Environment

Funding body University of Newcastle - Faculty of Engineering & Built Environment
Project Team Doctor Joe Ryan
Scheme Travel Grant
Role Lead
Funding Start 2014
Funding Finish 2014
GNo G1400721
Type Of Funding Internal
Category INTE
UON Y

20131 grants / $1,500

GraphMaster 7, Lleida, Spain, 25 - 28 June 2013$1,500

Funding body: University of Newcastle - Faculty of Engineering & Built Environment

Funding body University of Newcastle - Faculty of Engineering & Built Environment
Project Team Doctor Joe Ryan
Scheme Travel Grant
Role Lead
Funding Start 2013
Funding Finish 2013
GNo G1300862
Type Of Funding Internal
Category INTE
UON Y

20122 grants / $36,500

Group Mission : Explore and analyse structures and properties of chemical compounds using computer assisted mathematics, combinatorics and graph theory.$35,000

Funding body: Department of Industry, Innovation, Science, Research and Tertiary Education

Funding body Department of Industry, Innovation, Science, Research and Tertiary Education
Project Team Associate Professor Yuqing Lin, Doctor Joe Ryan, Emeritus Professor Mirka Miller, Professor Ljiljana Brankovic, Professor Brian Alspach
Scheme Australia-China Science and Research Fund (ACSRF): Group Missions
Role Investigator
Funding Start 2012
Funding Finish 2012
GNo G1200258
Type Of Funding Aust Competitive - Commonwealth
Category 1CS
UON Y

Workshop on Graph Theory and Applications, UNISMA, Malang, Indonesia, 11 July 2012$1,500

Funding body: University of Newcastle - Faculty of Engineering & Built Environment

Funding body University of Newcastle - Faculty of Engineering & Built Environment
Project Team Doctor Joe Ryan
Scheme Travel Grant
Role Lead
Funding Start 2012
Funding Finish 2012
GNo G1200663
Type Of Funding Internal
Category INTE
UON Y

20082 grants / $29,500

Networks, graphs and communications$22,000

Funding body: Department of Innovation, Industry, Science and Research

Funding body Department of Innovation, Industry, Science and Research
Project Team Emeritus Professor Mirka Miller, Professor Ljiljana Brankovic, Doctor Joe Ryan, Associate Professor Yuqing Lin
Scheme International Science Linkages Programme - French Australian Science and Technology Programme (FAST)
Role Investigator
Funding Start 2008
Funding Finish 2008
GNo G0188626
Type Of Funding Other Public Sector - Commonwealth
Category 2OPC
UON Y

New Staff Grant 2008$7,500

Funding body: University of Newcastle

Funding body University of Newcastle
Project Team Doctor Joe Ryan
Scheme New Staff Grant
Role Lead
Funding Start 2008
Funding Finish 2008
GNo G0189348
Type Of Funding Internal
Category INTE
UON Y

20032 grants / $6,540

Visit of Prof O Grosek from 8 October to 20 November 2003$4,655

Funding body: University of Newcastle

Funding body University of Newcastle
Project Team Doctor Joe Ryan
Scheme Visitor Grant
Role Lead
Funding Start 2003
Funding Finish 2003
GNo G0183345
Type Of Funding Internal
Category INTE
UON Y

ISGDA2003 - International Symposium on Graphs, Designs and Applications 30/09/03 to 4/10/03$1,885

Funding body: University of Newcastle

Funding body University of Newcastle
Project Team Doctor Joe Ryan
Scheme Travel Grant
Role Lead
Funding Start 2003
Funding Finish 2003
GNo G0183708
Type Of Funding Internal
Category INTE
UON Y

20021 grants / $2,400

Fourth CRACOW Conference on Graph Theory, Poland 16 - 20 September, 2002$2,400

Funding body: University of Newcastle

Funding body University of Newcastle
Project Team Doctor Joe Ryan
Scheme Travel Grant
Role Lead
Funding Start 2002
Funding Finish 2002
GNo G0182155
Type Of Funding Internal
Category INTE
UON Y

20011 grants / $1,049

12th Australasian Workshop on Combinatorial Algorithms, Indonesia 14-17 July 2001$1,049

Funding body: University of Newcastle

Funding body University of Newcastle
Project Team Doctor Joe Ryan
Scheme Travel Grant
Role Lead
Funding Start 2001
Funding Finish 2001
GNo G0180998
Type Of Funding Internal
Category INTE
UON Y
Edit

Research Supervision

Number of supervisions

Completed3
Current6

Total current UON EFTSL

Masters0.6
PhD2.25

Current Supervision

Commenced Level of Study Research Title / Program / Supervisor Type
2015 Masters H-supermagic covering on some classes of graphs
M Philosophy (Mathematics), Faculty of Science and Information Technology, The University of Newcastle
Co-Supervisor
2015 Masters Searching For Graphs That Are Close to The Moore Bound
M Philosophy (Mathematics), Faculty of Science and Information Technology, The University of Newcastle
Co-Supervisor
2014 PhD Graph Labeling and Application
PhD (Mathematics), Faculty of Science and Information Technology, The University of Newcastle
Principal Supervisor
2014 PhD Conditional Resolvability of Graphs
PhD (Mathematics), Faculty of Science and Information Technology, The University of Newcastle
Principal Supervisor
2014 PhD Power Domination in Graphs
PhD (Mathematics), Faculty of Science and Information Technology, The University of Newcastle
Principal Supervisor
2013 PhD Extremal Graph Theory
PhD (Computer Science), Faculty of Engineering and Built Environment, The University of Newcastle
Principal Supervisor

Past Supervision

Year Level of Study Research Title / Program / Supervisor Type
2015 PhD Large Interconnection Networks with Given Degree and Diameter
PhD (Computer Science), Faculty of Engineering and Built Environment, The University of Newcastle
Principal Supervisor
2013 PhD Antimagic Labeling of Graphs
PhD (Computer Science), Faculty of Engineering and Built Environment, The University of Newcastle
Co-Supervisor
2012 PhD Extremal Networks and Connectivity
PhD (Computer Science), Faculty of Engineering and Built Environment, The University of Newcastle
Co-Supervisor
Edit

Dr Joe Ryan

Position

Senior Lecturer
School of Elect Engineering and Computer Science
Faculty of Engineering and Built Environment

Focus area

Computer Science and Software Engineering

Contact Details

Email joe.ryan@newcastle.edu.au
Phone (02) 4921 6071
Fax (02) 4921 6929

Office

Room ES234
Building ES
Location Callaghan
University Drive
Callaghan, NSW 2308
Australia
Edit