2018 
Ferrero D, Grigorious C, Kalinowski T, Ryan J, Stephen S, 'Minimum rank and zero forcing number for butterfly networks', Journal of Combinatorial Optimization, (2018)
© 2018, Springer Science+Business Media, LLC, part of Springer Nature. Zero forcing is a graph propagation process introduced in quantum physics and theoretical computer science, ... [more]
© 2018, Springer Science+Business Media, LLC, part of Springer Nature. Zero forcing is a graph propagation process introduced in quantum physics and theoretical computer science, and closely related to the minimum rank problem. The minimum rank of a graph is the smallest possible rank over all matrices described by a given network. We use this relationship to determine the minimum rank and the zero forcing number of butterfly networks, concluding they present optimal properties in regards to both problems.



2018 
Susilawati, Baskoro ET, Simanjuntak R, Ryan J, 'On the vertex irregular total labeling for subdivision of trees', Australasian Journal of Combinatorics, 71 293302 (2018) [C1]



2018 
Tanna D, Ryan J, SemanicováFenovcíková A, Baca M, 'Vertex irregular reflexive labeling of prisms and wheels', AKCE International Journal of Graphs and Combinatorics, (2018)
© 2018 Kalasalingam University For a graph G we define klabeling ¿ such that the edges of G are labeled with integers {1,2,¿,ke} and the vertices of G are labeled with even integ... [more]
© 2018 Kalasalingam University For a graph G we define klabeling ¿ such that the edges of G are labeled with integers {1,2,¿,ke} and the vertices of G are labeled with even integers {0,2,¿,2kv}, where k=max{ke,2kv}. The labeling ¿ is called a vertex irregular reflexive klabeling if distinct vertices have distinct weights, where the vertex weight is defined as the sum of the label of that vertex and the labels of all edges incident this vertex. The smallest k for which such labeling exists is called the reflexive vertex strength of G. In this paper, we give exact values of reflexive vertex strength for prisms, wheels, fan graphs and baskets.



2018 
Dalfó C, Fiol MA, Miller M, Ryan J, ¿irán J, 'An algebraic approach to lifts of digraphs', Discrete Applied Mathematics, (2018)
© 2018 Elsevier B.V. We present some applications of a new matrix approach for studying the properties of the lift Ga of a voltage digraph, which has arcs weighted by the elements... [more]
© 2018 Elsevier B.V. We present some applications of a new matrix approach for studying the properties of the lift Ga of a voltage digraph, which has arcs weighted by the elements of a group. As a main result, when the involved group is Abelian, we completely determine the spectrum of Ga. As some examples of our technique, we study some basic properties of the Alegre digraph, and completely characterize the spectrum of a new family of digraphs, which contains the generalized Petersen graphs, and the Hoffman¿Singleton graph.



2018 
Badia V, PerezRoses H, Ryan J, 'Eulogy for Professor Mirka Miller (19492016)', MATHEMATICS IN COMPUTER SCIENCE, 12 251254 (2018)



2018 
Ryan J, 'A Brief Survey on the Contribution of Mirka Miller to the Security of Statistical Databases', MATHEMATICS IN COMPUTER SCIENCE, 12 255262 (2018)



2018 
Baca M, Irfan M, Ryan J, SemanicováFenovcíková A, Tanna D, 'Note on edge irregular reflexive labelings of graphs', AKCE International Journal of Graphs and Combinatorics, (2018)
© 2018 Kalasalingam University. For a graph G, an edge labeling fe:E(G)¿(1,2,...,ke) and a vertex labeling fv:V(G)¿(0,2,4,...,2kv) are called total klabeling, where k=max(ke,2kv)... [more]
© 2018 Kalasalingam University. For a graph G, an edge labeling fe:E(G)¿(1,2,...,ke) and a vertex labeling fv:V(G)¿(0,2,4,...,2kv) are called total klabeling, where k=max(ke,2kv). The total klabeling is called an edge irregular reflexive k labeling of the graph G, if for every two different edges xy and x'y' of G, one has wt(xy)=fv(x)+fe(xy)+fv(y)¿wt(x'y')=fv(x')+fe(x'y')+fv(y').The minimum k for which the graph G has an edge irregular reflexive klabeling is called the reflexive edge strength of G.In this paper we determine the exact value of the reflexive edge strength for cycles, Cartesian product of two cycles and for join graphs of the path and cycle with 2K2.



2018 
Kelarev A, Ryan J, Rylands L, Seberry J, Yi X, 'Discrete algorithms and methods for security of statistical databases related to the work of Mirka Miller', Journal of Discrete Algorithms, (2018)
© 2018 Elsevier B.V. This article gives a survey of discrete and combinatorial algorithms and methods for database security related to the work of Mirka Miller. The main contribut... [more]
© 2018 Elsevier B.V. This article gives a survey of discrete and combinatorial algorithms and methods for database security related to the work of Mirka Miller. The main contributions of Mirka Miller and coauthors to the security of statistical databases include the introduction of Static Audit Expert and theorems determining time complexity of its combinatorial algorithms, a polynomial time algorithm for deciding whether the maximum possible usability can be achieved in a statistical database with a special class of answerable statistics, NPcompleteness of similar problems concerning several other types of statistical databases, sharp upper bounds on the number of compromisefree queries in certain categories of statistical databases, and analogous results on applications of Static Audit Expert for the prevention of relative compromise.



2017 
Miller M, Ryan J, Ryjácek Z, 'Characterisation of graphs with exclusive sum labelling', Australasian Journal of Combinatorics, 69 334348 (2017) [C1] 


2017 
Miller M, Ryan J, Ryjácek Z, 'Characterisation of Graphs with Exclusive Sum Labelling', Electronic Notes in Discrete Mathematics, 60 8390 (2017)



2017 
Baca M, Irfan M, Ryan J, SemanicováFenovcíková A, Tanna D, 'On edge irregular reflexive labellings for the generalized friendship graphs', Mathematics, 5 (2017) [C1]



2017 
Dalfó C, Fiol MA, Miller M, Ryan J, 'On quotient digraphs and voltage digraphs', Australasian Journal of Combinatorics, 69 368374 (2017) [C1] 


2017 
Parthiban N, Ryan J, Rajasingh I, Sundara Rajan R, Nirmala Rani L, 'Exact wirelength of embedding chord graph into treebased architectures', International Journal of Networking and Virtual Organisations, 17 7687 (2017) [C1]



2017 
Dalfó C, Fiol MA, Miller M, Ryan J, 'From expanded digraphs to lifts of voltage digraphs and line digraphs', Australasian Journal of Combinatorics, 69 323333 (2017) [C1] 


2017 
Siddiqui MK, Miller M, Ryan J, 'Total edge irregularity strength of octagonal grid graph', UTILITAS MATHEMATICA, 103 277287 (2017) [C1]



2017 
Baca M, Baskoro ET, Brankovic L, Jendrol' S, Lin Y, Phanalasy O, et al., 'A survey of faceantimagic evaluations of graphs', AUSTRALASIAN JOURNAL OF COMBINATORICS, 69 382393 (2017) [C1]



2017 
Tanna D, Ryan J, SemanicovaFenovcikova A, 'Edge irregular reflexive labeling of prisms and wheels', AUSTRALASIAN JOURNAL OF COMBINATORICS, 69 394401 (2017) [C1]



2017 
Bong NH, Miller M, Ryan J, Sugeng KA, 'Max DDBS problem on butterfly networks', AUSTRALASIAN JOURNAL OF COMBINATORICS, 68 245264 (2017) [C1]



2017 
Grigorious C, Kalinowski T, Ryan J, Stephen S, 'The metric dimension of the circulant graph C(n,±1,2,3,4)', Australasian Journal of Combinatorics, 69 417441 (2017) [C1]



2017 
Wijaya RWN, SemanicováFenovcíková A, Ryan J, Kalinowski T, 'Hsupermagic labelings for firecrackers, banana trees and flowers', Australasian Journal of Combinatorics, 69 442451 (2017) [C1]



2017 
Bong NH, Ryan J, Sugeng KA, 'MaxDDBS Problem on Bene¿ Network', Journal of Interconnection Networks, 17 (2017) [C1]



2016 
Abawajy J, Kelarev AV, Miller M, Ryan J, 'Rees semigroups of digraphs for classification of data', Semigroup Forum, 92 121134 (2016) [C1]
© 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 zerodivisorfree 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.



2016 
Chowdhury M, Abawajy J, Jelinek HF, Kelarev AV, Ryan J, 'Matrix constructions of centroid sets for classification systems', Filomat, 30 23972403 (2016) [C1]
© 2016, University of Nis. All rights reserved. This article continues the investigation of matrix constructions motivated by their applications to the design of classification sy... [more]
© 2016, University of Nis. All rights reserved. This article continues the investigation of matrix constructions motivated by their applications to the design of classification systems. Our main theorems strengthen and generalize previous results by describing all centroid sets for classification systems that can be generated as onesided ideals with the largest weight in structural matrix semirings. Centroid sets are well known in data mining, where they are used for the design of centroidbased classification systems, as well as for the design of multiple classification systems combining several individual classifiers.



2016 
Baca M, Miller M, Ryan J, SemanicováFenovcíková A, 'On hantimagicness of disconnected graphs', Bulletin of the Australian Mathematical Society, 94 201207 (2016) [C1]
© 2016 Australian Mathematical Publishing Association Inc. A simple graph G = (V; E) admits an Hcovering if every edge in E belongs to at least one subgraph of G isomorphic to a ... [more]
© 2016 Australian Mathematical Publishing Association Inc. A simple graph G = (V; E) admits an Hcovering if every edge in E belongs to at least one subgraph of G isomorphic to a given graph H. Then the graph G is (a; d)Hantimagic if there exists a bijection f : ¿ E ¿ {1, 2, V + E} such that, for all subgraphs H0 of G isomorphic to H, the Hweights, wtf (H) =¿vv(H') f(v)+¿e¿(H') f(e) form an arithmetic progression with the initial term a and the common difference d. When f (V) = {1; 2 V}, then G is said to be super (a; d)Hantimagic. In this paper, we study super (a, d)Hantimagic labellings of a disjoint union of graphs for d = E(H) V(H).



2015 
Arumugam S, Froncek D, Ryan J, Ariyanti Sugeng K, Baca M, Miller M, 'Preface', Electronic Notes in Discrete Mathematics, 48 1 (2015)



2015 
Baca M, Miller M, Phanalasy O, Ryan J, SemanicováFenovcíková A, Sillasen AA, 'Totally antimagic total graphs', Australasian Journal of Combinatorics, 61 4256 (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 edgeweight of an edge is the sum of the label of the edge and the labels of the end vertices of that edge. The vertexweight 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 edgeantimagic total (vertexantimagic total) if all edgeweights (vertexweights) are pairwise distinct. If a labeling is simultaneously edgeantimagic total and vertexantimagic 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, doublestars and wheels are totally antimagic total. We also show that a union of regular totally antimagic total graphs is a totally antimagic total graph.



2015 
Holub P, Ryan JF, 'Degree diameter problem on triangular networks', Australasian Journal of Combinatorics, 63 333345 (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 K<inf>m,n</inf> 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.



2015 
RIZVI STR, KHALID M, ALI K, MILLER M, RYAN J, 'ON CYCLESUPERMAGICNESS OF SUBDIVIDED GRAPHS', Bulletin of the Australian Mathematical Society, (2015) [C1]
Lladó and Moragas [¿Cyclemagic graphs¿, Discrete Math. 307 (2007), 2925¿2933] showed the cyclicmagic and cyclicsupermagic behaviour of several classes of connected graphs. They... [more]
Lladó and Moragas [¿Cyclemagic graphs¿, Discrete Math. 307 (2007), 2925¿2933] showed the cyclicmagic and cyclicsupermagic behaviour of several classes of connected graphs. They discussed cyclemagic labellings of subdivided wheels and friendship graphs, but there are no further results on cyclemagic labellings of other families of subdivided graphs. In this paper, we find cyclemagic 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 cyclesupermagic labellings for nonuniform subdivided fans and triangular ladders.



2015 
SemanicováFenovcíková A, Baca M, Lascsáková M, Miller M, Ryan J, 'Wheels are CycleAntimagic', Electronic Notes in Discrete Mathematics, 48 1118 (2015) [C1]
© 2015 Elsevier B.V. A simple graph G admits an Hcovering if every edge in E(G) belongs to a subgraph of G isomorphic to H. An (a, d)Hantimagic total labeling of a graph G admi... [more]
© 2015 Elsevier B.V. A simple graph G admits an Hcovering if every edge in E(G) belongs to a subgraph of G isomorphic to H. An (a, d)Hantimagic total labeling of a graph G admitting an Hcovering 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<sup>'</sup> isomorphic to H, the sum of labels of all the edges and vertices belonging to H<sup>'</sup> 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 cycleantimagic total labelings of wheel.



2015 
Abawajy J, Kelarev AV, Ryan J, 'Ideal bases in constructions defined by directed graphs', ELECTRONIC JOURNAL OF GRAPH THEORY AND APPLICATIONS, 3 3549 (2015)



2015 
Abawajy J, Kelarev AV, Miller M, Ryan J, 'Distances of Centroid Sets in a GraphBased 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.



2015 
Stephen S, Rajan B, Ryan J, Grigorious C, William A, 'Power domination in certain chemical structures', Journal of Discrete Algorithms, 33 1018 (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 the... [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 <sup>¿p</sup>(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 (ReO<inf>3</inf>) lattices and silicate networks.



2014 
FeriaPurón R, Ryan J, PérezRosés H, 'Searching for Large MultiLoop Networks', Electronic Notes in Discrete Mathematics, 46 233240 (2014) [C1]
© 2014 Elsevier B.V. We describe and implement a computerbased method to find large multiloop graphs with given degree and diameter. For some values of degree and diameter, our ... [more]
© 2014 Elsevier B.V. We describe and implement a computerbased method to find large multiloop graphs with given degree and diameter. For some values of degree and diameter, our algorithm produces the largest known circulant graphs. We summarize our findings in a table.



2014 
Holub P, Miller M, PerezRoses H, Ryan J, 'Degree diameter problem on honeycomb networks', DISCRETE APPLIED MATHEMATICS, 179 139151 (2014) [C1]



2014 
Arumugam S, Miller M, Phanalasy O, Ryan J, 'Antimagic labeling of generalized pyramid graphs', ACTA MATHEMATICA SINICAENGLISH SERIES, 30 283290 (2014) [C1]



2014 
ABAWAJY J, KELAREV AV, MILLER M, RYAN J, 'Incidence Semirings of Graphs and Visible Bases', Bulletin of the Australian Mathematical Society, 89 451459 (2014) [C1]



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 4251 (2014) [C1]



2013 
Arumugam S, Baca M, Froncek D, Ryan J, Sugeng KA, 'Preface', AKCE International Journal of Graphs and Combinatorics, 10 (2013) 


2013 
Miller M, Ryan J, Ryjacek Z, Teska J, Vrana P, 'Stability of hereditary graph classes under closure operations', Journal of Graph Theory, 74 6780 (2013) [C1]



2013 
Miller M, Phanalasy O, Ryan J, Rylands L, 'Sparse graphs with vertex antimagic edge labelings', AKCE International Journal of Graphs and Combinatorics, 10 193198 (2013) [C1]



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 237243 (2013) [C1] 


2013 
Miller M, Ryan J, Ryjácek Z, 'Distancelocally disconnected graphs', Discussiones Mathematicae  Graph Theory, 33 203215 (2013) [C1]
For an integer k = 1, we say that a (finite simple undirected) graph G is kdistancelocally disconnected, or simply klocally disconnected if, for any x ¿ V (G), the set of verti... [more]
For an integer k = 1, we say that a (finite simple undirected) graph G is kdistancelocally disconnected, or simply klocally 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 klocally 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.



2012 
Miller M, PérezRosés H, Ryan J, 'The Maximum DegreeandDiameterBounded Subgraph in the Mesh', CoRR, abs/1203.4069 (2012) 


2012 
Miller M, PerezRoses H, Ryan JF, 'The maximum degree and diameterbounded subgraph in the mesh', Discrete Applied Mathematics, 160 17821790 (2012) [C1]



2012 
Miller M, Phanalasy O, Ryan JF, Rylands L, 'Antimagicness of some families of generalized graphs', Australasian Journal of Combinatorics, 53 179190 (2012) [C1]



2011 
Sugeng KA, Ryan JF, 'Clique vertex magic cover of a graph', Mathematics in Computer Science, 5 113118 (2011) [C1]



2011 
Miller M, Rajan B, Ryan JF, 'Foreword', Mathematics in Computer Science, 5 12 (2011) [C3] 


2011 
Marshall KL, Miller M, Ryan JF, 'Extremal graphs without cycles of length 8 or less', Electronic Notes in Discrete Mathematics, 38 615620 (2011) [C2]



2011 
Miller M, Phanalasy O, Ryan JF, 'All graphs have antimagic total labelings', Electronic Notes in Discrete Mathematics, 38 645650 (2011) [C1]



2011 
Dafik, Miller M, Ryan J, Baca M, 'Super edgeantimagic total labelings of mK,n,n', ARS COMBINATORIA, 101 97107 (2011) [C1]



2011 
Rylands L, Phanalasy O, Ryan JF, Miller M, 'Construction for antimagic generalized web graphs', AKCE International Journal of Graphs and Combinatorics, 8 141149 (2011) [C1]



2010 
Maryati TK, Salman ANM, Baskoro ET, Ryan JF, Miller M, 'On Hsupermagic labelings for certain shackles and amalgamations of a connected graph', Utilitas Mathematica, 83 333342 (2010) [C1]



2009 
Delorme C, Flandrin E, Lin Y, Miller M, Ryan JF, 'On extremal graphs with bounded girth', Electronic Notes in Discrete Mathematics, 34 653657 (2009) [C2]



2009 
Kelarev A, Ryan JF, Yearwood J, 'Cayley graphs as classifiers for data mining: The influence of asymmetries', Discrete Mathematics, 309 53605369 (2009) [C1]



2009 
Dafik, Miller M, Ryan JF, Baca M, 'On super (a, d)edgeantimagic total labeling of disconnected graphs', Discrete Mathematics, 309 49094915 (2009) [C1]



2009 
Baca M, Dafik, Miller M, Ryan J, 'Antimagic labeling of disjoint union of scrowns', Utilitas Mathematica, 79 193205 (2009) [C1]



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 6585 (2009) [C1]



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 3948 (2009) [C1]



2009 
Arumugam S, Bloom GS, Miller M, Ryan JF, 'Some open problems on graph labelings', AKCE International Journal of Graphs and Combinatorics, 6 229236 (2009) [C1] 


2009 
Ryan JF, 'Exclusive sum labeling of graphs: A survey', AKCE International Journal of Graphs and Combinatorics, 6 113126 (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 1932 (2009) [C1] 


2008 
Dafik, Miller M, Ryan JF, Baca M, 'Antimagic labeling of the union of two stars', The Australasian Journal of Combinatorics, 42 3544 (2008) [C1]



2008 
Fernau H, Ryan J, Sugeng KA, 'A sum labelling for the generalised friendship graph', Discrete Mathematics, 308 734740 (2008) [C1]



2008 
Baca M, Dafik, Miller M, 'Edgeantimagic total labeling of disjoint union of caterpillars', Journal of Combinatorial Mathematics and Combinatorial Computing, 65 6170 (2008) [C1]



2008 
Dafik, Miller M, Ryan J, Baca M, 'On antimagic labelings of disjoint union of complete spartite graphs', Journal of Combinatorial Mathematics and Combinatorial Computing, 65 4149 (2008) [C1]



2007 
Sugeng KA, Ryan J, 'On several classes of monographs', Australasian Journal of Combinatorics, 37 277284 (2007) [C1]
Let G = (V, E) be a finite (nonempty) graph. A monograph is a graph in which all vertices are assigned distinct real number labels so that the positive difference of the endvert... [more]
Let G = (V, E) be a finite (nonempty) graph. A monograph is a graph in which all vertices are assigned distinct real number labels so that the positive difference of the endvertices of every edge is also a vertex label. In this paper we study the properties of monographs and construct signatures for several classes of graph, such as cycles, cycles with chord, fan graphs Fn, kite graphs, chains of monographs and necklaces of monographs.



2007 
Baca M, Jendrol S, Miller M, Ryan J, 'On irregular total labellings', DISCRETE MATHEMATICS, 307 13781388 (2007) [C1]



2006 
Baca M, Lin Y, Miller M, Ryan JF, 'Antimagic labelings of Mobius grids', Ars Combinatoria, 78 313 (2006) [C1]



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 113130 (2006) [C1] 


2006 
Mishra V, Stranieri A, Miller M, Ryan J, 'Knowledge based regulation of statistical databases', WSEAS Transactions on Information Science and Applications, 3 239244 (2006) [C1]
A statistical database system is a system that contains information about individuals, companies or organisations that enables authorized users to retrieve aggregate statistics su... [more]
A statistical database system is a system that contains information about individuals, companies or organisations that enables authorized users to retrieve aggregate statistics such as mean and count. The regulation of a statistical database involves limiting the use of the database so that no sequence of queries is sufficient to infer protected information about an individual. The database is said to be compromised when individual confidential information is obtained as a result of a statistical query. Devices to protect against compromise include adding noise to the data or restricting a query. While effective, these techniques are sometimes too strong in that legitimate compromises for reasons of public safety are always blocked. Further, a statistical database can be often be compromised with some knowledge about the database attributes (working knowledge), the real world (supplementary knowledge) or the legal system (legal knowledge). In this paper we illustrate that a knowledge based system that represents working, supplementary and legal knowledge can contribute to the regulation of a statistical database.



2006 
Gimbert J, Lopez N, Miller M, Ryan J, 'Characterization of eccentric digraphs', DISCRETE MATHEMATICS, 306 210219 (2006) [C1]



2006 
Balbuena C, Barker E, Das KC, Lin Y, Miller M, Ryan J, et al., 'On the degrees of a strongly vertexmagic graph', Discrete Mathematics, 306 539551 (2006) [C1]



2004 
Baca M, Jendrol S, Miller M, Ryan J, 'Antimagic labelings of generalized Petersen graphs that are plane', ARS COMBINATORIA, 73 115128 (2004) [C1]



2000 
Miller M, Dahlhaus E, Horak P, Ryan JF, 'The train marshalling problem', Discrete Applied Mathematics, 103 4154 (2000) [C1]



1999 
Sutton MJ, Miller M, Ryan JF, Slamin, 'Connected graphs which are not mod sum graphs', Discrete Math, 195 287293 (1999) [C1]



1999 
Miller M, Ryan JF, Slamin, 'Integral sum numbers of cocktail party graphs and symmetric complete bipartite graphs', Bulletin of ICA, 25 2328 (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 6576 (1998) [C1]



1998 
Miller M, Ryan J, Smyth W, 'The Sum Number of the Cocktail Party Graph', Bulletin of the ICA, 22 7990 (1998) [C1] 


1998 
Miller M, Ryan JF, Smyth WF, Slamin, 'Labelling Wheels for Minimum Sum Number', Journal of Combinatorial Mathematics and Combinatorial Computing, 28 289297 (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 111 (1998) [C1]


