Magic and Antimagic Graphs
Attributes, Observations and Challenges in Graph Labelings
Article
The class \({\mathcal {E}}_k\) E k ...
Article
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 ...
Chapter and Conference Paper
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...
Chapter and Conference Paper
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 ...
Article
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...
Book
Chapter
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...
Chapter and Conference Paper
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...
Chapter
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 ...
Chapter
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...
Chapter
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...
Chapter
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...
Chapter
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...
Chapter
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...
Chapter
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...
Article
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...
Article
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...
Book and Conference Proceedings
28th International Workshop, IWOCA 2017, Newcastle, NSW, Australia, July 17-21, 2017, Revised Selected Papers
Chapter and Conference Paper
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 ...
Article
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...