Skip to main content

previous disabled Page of 2
and
  1. No Access

    Article

    On Exclusive Sum Labellings of Hypergraphs

    The class \({\mathcal {E}}_k\) E k ...

    Christopher Purcell, Joe Ryan, Zdeněk Ryjáček, Mária Skyvová in Graphs and Combinatorics (2022)

  2. No Access

    Article

    Collusion-resistant protocols for private processing of aggregated queries in distributed databases

    Private processing of database queries protects the confidentiality of sensitive data when queries are answered. It is important to design collusion-resistant protocols ensuring that privacy remains protected ...

    Leanne Rylands, Jennifer Seberry, Xun Yi in Distributed and Parallel Databases (2021)

  3. No Access

    Chapter and Conference Paper

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

    literature claims that Small to Medium Size Enterprises (SMEs), as compared to larger setups, may not be able to experience all the benefits of the fourth industrial revolution (Industry 4.0). In or...

    Fareed Ud Din, David Paul, Joe Ryan in Agents and Multi-Agent Systems: Technologi… (2020)

  4. No Access

    Chapter and Conference Paper

    Monitoring the Edges of a Graph Using Distances

    We introduce a new graph-theoretic concept in the area of network monitoring. A set M of vertices of a graph G is a distance-edge-monitoring set if for every edge e of G, there is a vertex x of M and a vertex y ...

    Florent Foucaud, Ralf Klasing, Mirka Miller in Algorithms and Discrete Applied Mathematics (2020)

  5. No Access

    Article

    Minimum rank and zero forcing number for butterfly networks

    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...

    Daniela Ferrero, Cyriac Grigorious in Journal of Combinatorial Optimization (2019)

  6. No Access

    Book

    Magic and Antimagic Graphs

    Attributes, Observations and Challenges in Graph Labelings

    Prof. Martin Bača, Mirka Miller, Joe Ryan in Developments in Mathematics (2019)

  7. No Access

    Chapter

    Conclusion

    The final chapter opens with a brief summary of the book. This is followed by a collection of conjectures and problems that, at the time of writing, were still unsolved. To the interested researcher this would...

    Martin Bača, Mirka Miller, Joe Ryan in Magic and Antimagic Graphs (2019)

  8. No Access

    Chapter and Conference Paper

    Improved Bound for Dilation of an Embedding onto Circulant Networks

    Implementation of parallel algorithms and simulation of different interconnection networks need an effective tool, that is, graph embedding. This paper focuses on improving a lower bound obtained in Rajan et a...

    R. Sundara Rajan, T. M. Rajalaxmi, Joe Ryan in Applied Mathematics and Scientific Computi… (2019)

  9. No Access

    Chapter

    Introduction

    The area of graph theory has experienced fast development during the last 70 years, and among the huge diversity of concepts that appear while studying this subject, one that has gained a lot of popularity is ...

    Martin Bača, Mirka Miller, Joe Ryan in Magic and Antimagic Graphs (2019)

  10. No Access

    Chapter

    Magic and Supermagic Graphs

    This chapter introduces magic and supermagic graphs giving relevant definitions and tracing the evolution of magic graphs from its genesis in magic squares. The text proceeds to study magic and supermagic labe...

    Martin Bača, Mirka Miller, Joe Ryan in Magic and Antimagic Graphs (2019)

  11. No Access

    Chapter

    Edge-Magic Total Labelings

    After vertex magic total labelings, this chapter has a focus on edge magic total labelings. Labeling schemes are given for connected and disconnected graphs in addition to well-known graph families. Strong sup...

    Martin Bača, Mirka Miller, Joe Ryan in Magic and Antimagic Graphs (2019)

  12. No Access

    Chapter

    Edge-Antimagic Total Labelings

    This chapter focuses on edge-antimagic graphs under both vertex labelings and total labelings. Super edge-antimagic total labelings are given for standard graphs and (a,1) edge-antimagic total labelings are in...

    Martin Bača, Mirka Miller, Joe Ryan in Magic and Antimagic Graphs (2019)

  13. No Access

    Chapter

    Vertex-Magic Total Labelings

    This chapter is devoted to the study of vertex magic total labelings. Constructions are given for regular and non-regular graphs as well as for some standard graph families. These labelings are also explored f...

    Martin Bača, Mirka Miller, Joe Ryan in Magic and Antimagic Graphs (2019)

  14. No Access

    Chapter

    Vertex-Antimagic Total Labelings

    Following the chapters on magic type labelings, this chapter begins the section of the book devoted to antimagic labelings. Vertex antimagic and super vertex antimagic labelings, both edge labels and total lab...

    Martin Bača, Mirka Miller, Joe Ryan in Magic and Antimagic Graphs (2019)

  15. No Access

    Chapter

    Graceful and Antimagic Labelings

    This chapter explores the relationship between antimagic labeling and alpha labelings and also the well-known graceful labelings. Much of this chapter looks at interesting labelings and structures on trees, in...

    Martin Bača, Mirka Miller, Joe Ryan in Magic and Antimagic Graphs (2019)

  16. No Access

    Article

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

    This survey directs its focus, not on the history of security in statistical databases, but on the contribution of Mirka Miller to this field. It begins with her early work in her PhD thesis in which she forma...

    Joe Ryan in Mathematics in Computer Science (2018)

  17. No Access

    Article

    Eulogy for Professor Mirka Miller (1949–2016)

    The CIMPA Research School on Mathematical Models for Security Applications was dedicated to the memory of Emeritus Professor Mirka Miller, who suggested that it be held in Havana. Mirka Miller, member of the edit...

    Valentina Badia, Hebert Pérez-Rosés, Joe Ryan in Mathematics in Computer Science (2018)

  18. No Access

    Book and Conference Proceedings

    Combinatorial Algorithms

    28th International Workshop, IWOCA 2017, Newcastle, NSW, Australia, July 17-21, 2017, Revised Selected Papers

    Ljiljana Brankovic, Joe Ryan, William F. Smyth in Lecture Notes in Computer Science (2018)

  19. No Access

    Chapter and Conference Paper

    Trends in Temporal Reasoning: Constraints, Graphs and Posets

    Temporal reasoning finds many applications in numerous fields of artificial intelligence – frameworks for representing and analyzing temporal information are therefore important. Allen’s interval algebra is a ...

    Jacqueline W. Daykin, Mirka Miller, Joe Ryan in Mathematical Aspects of Computer and Infor… (2016)

  20. No Access

    Article

    Antimagic Labelings of Join Graphs

    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 $${\{1...

    Martin Bača, Oudone Phanalasy, Joe Ryan in Mathematics in Computer Science (2015)

previous disabled Page of 2