Joseph F. Ryan

According to our database1, Joseph F. Ryan authored at least 59 papers between 1998 and 2020.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of two.



In proceedings 
PhD thesis 





Validating Time Efficiency of AOSR 2.0: A Novel WMS Planner Algorithm for SMEs, under Industry 4.0.
J. Softw., 2020

An improved Moore bound and some new optimal families of mixed Abelian Cayley graphs.
Discret. Math., 2020

Revitalising and Validating the Novel Approach of xAOSF Framework Under Industry 4.0 in Comparison with Linear SC.
Proceedings of the Agents and Multi-Agent Systems: Technologies and Applications 2020, 2020

Monitoring the Edges of a Graph Using Distances.
Proceedings of the Algorithms and Discrete Applied Mathematics, 2020

Minimum rank and zero forcing number for butterfly networks.
J. Comb. Optim., 2019

An algebraic approach to lifts of digraphs.
Discret. Appl. Math., 2019

Note on edge irregular reflexive labelings of graphs.
AKCE Int. J. Graphs Comb., 2019

A Brief Survey on the Contribution of Mirka Miller to the Security of Statistical Databases.
Math. Comput. Sci., 2018

Eulogy for Professor Mirka Miller (1949-2016).
Math. Comput. Sci., 2018

Discrete algorithms and methods for security of statistical databases related to the work of Mirka Miller.
J. Discrete Algorithms, 2018

J. Discrete Algorithms, 2018

MaxDDBS Problem on Beneš Network.
J. Interconnect. Networks, 2017

Exact wirelength of embedding chord graph into tree-based architectures.
Int. J. Netw. Virtual Organisations, 2017

Characterisation of Graphs with Exclusive Sum Labelling.
Electron. Notes Discret. Math., 2017

Cube-magic labelings of grids.
CoRR, 2017

The metric dimension of the circulant graph C(n, \pm\{1, 2, 3, 4\}).
CoRR, 2017

MaxDDBS problem on butterfly networks.
Australas. J Comb., 2017

H-supermagic labelings for firecrackers, banana trees and flowers.
CoRR, 2016

On the power domination number of de Bruijn and Kautz digraphs.
CoRR, 2016

In memoriam Emeritus Professor Mirka Miller 09-05-1949 : 02-01-2016.
AKCE Int. J. Graphs Comb., 2016

Antimagic Labelings of Join Graphs.
Math. Comput. Sci., 2015

Distances of Centroid Sets in a Graph-Based Construction for Information Security Applications.
Math. Comput. Sci., 2015

Power domination in certain chemical structures.
J. Discrete Algorithms, 2015

Wheels are Cycle-Antimagic.
Electron. Notes Discret. Math., 2015

Electron. Notes Discret. Math., 2015

Ideal basis in constructions defined by directed graphs.
Electron. J. Graph Theory Appl., 2015

Degree diameter problem on triangular networks.
Australas. J Comb., 2015

Totally antimagic total graphs.
Australas. J Comb., 2015

Trends in Temporal Reasoning: Constraints, Graphs and Posets.
Proceedings of the Mathematical Aspects of Computer and Information Sciences, 2015

Searching for Large Multi-Loop Networks.
Electron. Notes Discret. Math., 2014

Antimagicness for a family of generalized antiprism graphs.
Electron. J. Graph Theory Appl., 2014

Degree diameter problem on honeycomb networks.
Discret. Appl. Math., 2014

Stability of Hereditary Graph Classes Under Closure Operations.
J. Graph Theory, 2013

Distance-locally disconnected graphs.
Discuss. Math. Graph Theory, 2013

An Application of Completely Separating Systems to Graph Labeling.
Proceedings of the Combinatorial Algorithms - 24th International Workshop, 2013

Construction Techniques for Digraphs with Minimum Diameter.
Proceedings of the Combinatorial Algorithms - 24th International Workshop, 2013

The maximum degree and diameter-bounded subgraph in the mesh.
Discret. Appl. Math., 2012

Antimagicness of some families of generalized graphs.
Australas. J Comb., 2012

Clique Vertex Magic Cover of a Graph.
Math. Comput. Sci., 2011

Math. Comput. Sci., 2011

All Graphs Have Antimagic Total Labelings.
Electron. Notes Discret. Math., 2011

Extremal Graphs without Cycles of Length 8 or Less.
Electron. Notes Discret. Math., 2011

Super edge-antimagic total labelings of mK<sub>n, n, n</sub>.
Ars Comb., 2011

On Antimagic Labeling for Generalized Web and Flower Graphs.
Proceedings of the Combinatorial Algorithms - 21st International Workshop, 2010

On Extremal Graphs with Bounded Girth.
Electron. Notes Discret. Math., 2009

Cayley graphs as classifiers for data mining: The influence of asymmetries.
Discret. Math., 2009

On super (a, d)-edge-antimagic total labeling of disconnected graphs.
Discret. Math., 2009

A sum labelling for the generalised friendship graph.
Discret. Math., 2008

Antimagic labeling of the union of stars.
Australas. J Comb., 2008

On irregular total labellings.
Discret. Math., 2007

On several classes of monographs.
Australas. J Comb., 2007

Characterization of eccentric digraphs.
Discret. Math., 2006

On the degrees of a strongly vertex-magic graph.
Discret. Math., 2006

Antimagic labelings of Msbius grids.
Ars Comb., 2006

Antimagic Labelings of Generalized Petersen Graphs That Are Plane.
Ars Comb., 2004

The train marshalling problem.
Discret. Appl. Math., 2000

Connected graphs which are not mod sum graphs.
Discret. Math., 1999

A Note on Constructing Large Cayley Graphs of Given Degree and Diameter by Voltage Assignments.
Electron. J. Comb., 1998

Large graphs with small degree and diameter: a voltage assignment approach.
Australas. J Comb., 1998