scholarly journals On a graph labelling conjecture involving coloured labels

2021 ◽  
Author(s):  
Julien Bensmail
Keyword(s):  
Graph Labelling

scholarly journals GRAPH LABELLING TECHNIQUES

2018 ◽  
Vol 98 (3) ◽  
pp. 512-513
Author(s):  
DUSHYANT KIRITBHAI TANNA
Keyword(s):  
Graph Labelling

Evaluation Routing of Reaction Mechanism with Different Colour Mobility of Graph Labelling

2017 ◽  
Vol 11 (2) ◽  
pp. 521-524
Author(s):  
V. Narayanan ◽  
J. B. Veera Malini ◽  
G. Baskar
Keyword(s):  
Reaction Mechanism ◽  
Graph Labelling

scholarly journals Semi-supervised graph labelling reveals increasing partisanship in the United States Congress

2019 ◽  
Vol 4 (1) ◽  
Author(s):  
Max Glonek ◽  
Jonathan Tuke ◽  
Lewis Mitchell ◽  
Nigel Bean
Keyword(s):  
United States ◽  
The United States ◽  
United States Congress ◽  
Graph Labelling

An Adiabatic Quantum Algorithm for Determining Gracefulness of a Graph

2017 ◽  
Vol 72 (7) ◽  
pp. 637-645
Author(s):  
Sayed Mohammad Hosseini ◽  
Mahdi Davoudi Darareh ◽  
Shahrooz Janbaz ◽  
Ali Zaghian
Keyword(s):  
Time Complexity ◽  
Optimization Problem ◽  
Quantum Algorithm ◽  
Combinatorial Optimization Problem ◽  
Sufficient Condition ◽  
Problem Size ◽  
Edge Label ◽  
General Sufficient Condition ◽  
Graph Labelling ◽  
The Difference

AbstractGraph labelling is one of the noticed contexts in combinatorics and graph theory. Graceful labelling for a graph G with e edges, is to label the vertices of G with 0, 1, ℒ, e such that, if we specify to each edge the difference value between its two ends, then any of 1, 2, ℒ, e appears exactly once as an edge label. For a given graph, there are still few efficient classical algorithms that determine either it is graceful or not, even for trees – as a well-known class of graphs. In this paper, we introduce an adiabatic quantum algorithm, which for a graceful graph G finds a graceful labelling. Also, this algorithm can determine if G is not graceful. Numerical simulations of the algorithm reveal that its time complexity has a polynomial behaviour with the problem size up to the range of 15 qubits. A general sufficient condition for a combinatorial optimization problem to have a satisfying adiabatic solution is also derived.

Sign in / Sign up

Export Citation Format

Share Document