Joseph F. Ryan

Martin Baca

AKCE Int. J. Graphs Comb., 2020

Revitalising and Validating the Novel Approach of xAOSF Framework Under Industry 4.0 in Comparison with Linear SC.

[BibT_eX]

[DOI]

Proceedings of the Agents and Multi-Agent Systems: Technologies and Applications 2020, 2020

Monitoring the Edges of a Graph Using Distances.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Discrete Applied Mathematics, 2020

2019

Minimum rank and zero forcing number for butterfly networks.

[BibT_eX]

[DOI]

J. Comb. Optim., 2019

An algebraic approach to lifts of digraphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2019

Note on edge irregular reflexive labelings of graphs.

[BibT_eX]

[DOI]

Martin Baca

Muhammad Irfan

Dushyant Tanna

AKCE Int. J. Graphs Comb., 2019

2018

A Brief Survey on the Contribution of Mirka Miller to the Security of Statistical Databases.

[BibT_eX]

[DOI]

Math. Comput. Sci., 2018

Eulogy for Professor Mirka Miller (1949-2016).

[BibT_eX]

[DOI]

Valentina Badia

Hebert Pérez-Rosés

Math. Comput. Sci., 2018

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

[BibT_eX]

[DOI]

J. Discrete Algorithms, 2018

Editorial.

[BibT_eX]

[DOI]

Ljiljana Brankovic

William F. Smyth

J. Discrete Algorithms, 2018

2017

MaxDDBS Problem on Beneš Network.

[BibT_eX]

[DOI]

Novi H. Bong

J. Interconnect. Networks, 2017

Exact wirelength of embedding chord graph into tree-based architectures.

[BibT_eX]

[DOI]

Int. J. Netw. Virtual Organisations, 2017

Characterisation of Graphs with Exclusive Sum Labelling.

[BibT_eX]

[DOI]

Rachel Wulan Nirmalasari Wijaya

Zdenek Ryjácek

Electron. Notes Discret. Math., 2017

Cube-magic labelings of grids.

[BibT_eX]

[DOI]

Rachel Wulan Nirmalasari Wijaya

Thomas Kalinowski

CoRR, 2017

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

[BibT_eX]

[DOI]

CoRR, 2017

MaxDDBS problem on butterfly networks.

[BibT_eX]

[DOI]

Australas. J Comb., 2017

2016

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

[BibT_eX]

[DOI]

Thomas Kalinowski

CoRR, 2016

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

[BibT_eX]

[DOI]

CoRR, 2016

In memoriam Emeritus Professor Mirka Miller 09-05-1949 : 02-01-2016.

[BibT_eX]

[DOI]

AKCE Int. J. Graphs Comb., 2016

2015

Antimagic Labelings of Join Graphs.

[BibT_eX]

[DOI]

Martin Baca

Oudone Phanalasy

Math. Comput. Sci., 2015

Distances of Centroid Sets in a Graph-Based Construction for Information Security Applications.

[BibT_eX]

[DOI]

Math. Comput. Sci., 2015

Power domination in certain chemical structures.

[BibT_eX]

[DOI]

J. Discrete Algorithms, 2015

Wheels are Cycle-Antimagic.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2015

Preface.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2015

Ideal basis in constructions defined by directed graphs.

[BibT_eX]

[DOI]

Jemal H. Abawajy

Andrei V. Kelarev

Electron. J. Graph Theory Appl., 2015

Degree diameter problem on triangular networks.

[BibT_eX]

[DOI]

Premysl Holub

Australas. J Comb., 2015

Totally antimagic total graphs.

[BibT_eX]

[DOI]

Anita Abildgaard Sillasen

Australas. J Comb., 2015

Trends in Temporal Reasoning: Constraints, Graphs and Posets.

[BibT_eX]

[DOI]

Jacqueline W. Daykin

Proceedings of the Mathematical Aspects of Computer and Information Sciences, 2015

2014

Searching for Large Multi-Loop Networks.

[BibT_eX]

[DOI]

Ramiro Feria-Purón

Hebert Pérez-Rosés

Electron. Notes Discret. Math., 2014

Antimagicness for a family of generalized antiprism graphs.

[BibT_eX]

[DOI]

Electron. J. Graph Theory Appl., 2014

Degree diameter problem on honeycomb networks.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2014

2013

Stability of Hereditary Graph Classes Under Closure Operations.

[BibT_eX]

[DOI]

J. Graph Theory, 2013

Distance-locally disconnected graphs.

[BibT_eX]

[DOI]

Zdenek Ryjácek

Discuss. Math. Graph Theory, 2013

An Application of Completely Separating Systems to Graph Labeling.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Algorithms - 24th International Workshop, 2013

Construction Techniques for Digraphs with Minimum Diameter.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Algorithms - 24th International Workshop, 2013

2012

The maximum degree and diameter-bounded subgraph in the mesh.

[BibT_eX]

[DOI]

Hebert Pérez-Rosés

Discret. Appl. Math., 2012

Antimagicness of some families of generalized graphs.

[BibT_eX]

[DOI]

Australas. J Comb., 2012

2011

Clique Vertex Magic Cover of a Graph.

[BibT_eX]

[DOI]

Math. Comput. Sci., 2011

Foreword.

[BibT_eX]

[DOI]

Bharati Rajan

Math. Comput. Sci., 2011

All Graphs Have Antimagic Total Labelings.

[BibT_eX]

[DOI]

Oudone Phanalasy

Electron. Notes Discret. Math., 2011

Extremal Graphs without Cycles of Length 8 or Less.

[BibT_eX]

[DOI]

Kim Marshall

Electron. Notes Discret. Math., 2011

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

[BibT_eX]

Ars Comb., 2011

2010

On Antimagic Labeling for Generalized Web and Flower Graphs.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Algorithms - 21st International Workshop, 2010

2009

On Extremal Graphs with Bounded Girth.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2009

Cayley graphs as classifiers for data mining: The influence of asymmetries.

[BibT_eX]

[DOI]

Andrei V. Kelarev

John Yearwood

Discret. Math., 2009

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

[BibT_eX]

[DOI]

Discret. Math., 2009

2008

A sum labelling for the generalised friendship graph.

[BibT_eX]

[DOI]

Henning Fernau

Discret. Math., 2008

Antimagic labeling of the union of stars.

[BibT_eX]

[DOI]

Australas. J Comb., 2008

2007

On irregular total labellings.

[BibT_eX]

[DOI]

Discret. Math., 2007

On several classes of monographs.

[BibT_eX]

[DOI]