Key speakers

Belal Ehsan Baaquie 

HelixtapTechnologies, Singapore

Title: Quantum Computers: An Epoch-Making Technology

Abstract: Quantum Computers: An Epoch-Making Technology introduces the central concepts of a quantum computer. Quantum information science is a new paradigm for information science and the talk discusses the principles of quantum mechanics that explain why it is trillions of times faster than existing supercomputer. The areas of the applications of this epoch-making technology to various fields are briefly discussed. The prospects of quantum computers, including both its advantages and the bottlenecks it faces, are reviewed. 

See here: https://www.aparat.com/v/5mLta

Brendan McKay 

School of Computing, Australian National University

Title: Give me graphs

Abstract: There are many occasions when a graph theorist, or someone involved in applications of graphs, needs to consult a collection of graphs. This may be to find a counterexample to a conjecture, to assist in a proof, or to find experimental relations between graph parameters to guide future directions. If a well-studied class of graphs, and not too many of them, the best approach is visit a graph repository where the graphs are available.  We will demonstrate the best such repository, called the House of Graphs.  If a larger collection of graphs is needed, or they are not in a class served by a repository, graph generation is required. This is the main focus of the talk.  The primary difficulty with graph generation is to achieve complete isomorphism reduction when the number of graphs is very large.  We will explain the main approaches and demonstrate a few generators. One example is the speaker's program Surge, which can generate all the isomers of a chemical formula much faster than previous programs.

Tomas Vetrik

University of the Free State, South Africa

Title: General distance-based indices of graphs

Abstract:

Topological indices are studied due to their wide applications, especially in chemistry. We recently introduced several general distance-based topological indices such as the general eccentric distance sum, general degree-eccentricity index, general degree distance and general Gutman index.

The general eccentric distance sum is a topological index generalizing the classical eccentric distance sum, Wiener index, total eccentricity index and first Zagreb eccentricity index. Similarly, general degree-eccentricity index, general degree distance and general Gutman index generalize several other indices. It is useful to study general indices, because results for particular indices are special cases of general results.

We present the definitions of general indices and other graph theory terms in a way which is easy to follow. Then, we present some sharp bounds and extremal graphs for general indices for important classes of graphs such as general graphs, bipartite graphs, trees and unicyclic graphs.

Accepted papers:

 02230-82267