Results 31 to 40 of about 5,409,269 (206)
On dynamic colouring of cartesian product of complete graph with some graphs
Journal of Taibah University for Science, 2020 A proper vertex colouring is called a 2-dynamic colouring, if for every vertex v with degree at least 2, the neighbours of v receive at least two colours. The smallest integer k such that G has a dynamic colouring with k colours denoted by $\chi _2(G) $.
K. Kaliraj +2 more
doaj +1 more source
Dimensi Metrik Kuat Lokal Graf Hasil Operasi Kali Kartesian
Contemporary Mathematics and Applications (ConMathA), 2020 The strong local metric dimension is the development result of a strong metric dimension study, one of the study topics in graph theory. Some of graphs that have been discovered about strong local metric dimension are path graph, star graph, complete ...
Nurma Ariska Sutardji +2 more
doaj +1 more source
On the edge irregular reflexive labeling of corona product of graphs with path
AKCE International Journal of Graphs and Combinatorics, 2021 We define a total k-labeling of a graph G as a combination of an edge labeling and a vertex labeling such that if and if where The total k-labeling is called an edge irregular reflexive k-labeling of G if every two different edges has distinct edge ...
Kooi-Kuan Yoong +5 more
doaj +1 more source
Resonances and Partial Delocalization on the Complete Graph [PDF]
, 2014 Random operators may acquire extended states formed from a multitude of mutually resonating local quasi-modes. This mechanics is explored here in the context of the random Schrödinger operator on the complete graph.
M. Aizenman, M. Shamis, S. Warzel
semanticscholar +1 more source
Aksioma: Jurnal Program Studi Pendidikan Matematika, 2018 This study aims to determine the minimum spanning tree of a complete graph K_n with weight constraints and completion using the cutting plane method. The cutting plane method is one of the algorithms included in the exact method.
Dewi Suhika, Wamiliana Wamiliana
doaj +1 more source
AIMS Mathematics, 2021 In this paper, it is explicitly determined the r-dynamic chromatic number of the direct product of any given path with either a complete graph or a wheel graph.
T. Deepa +2 more
doaj +1 more source
On the r-dynamic chromatic number of the corronation by complete graph
, 2018 In this paper we will study the r-dynamic chromatic number of the coronation by complete graph. A proper k-coloring of graph G such that the neighbors of any vertex v receive at least min{r, d(v)} different colors.
Arika Indah Kristiana +2 more
semanticscholar +1 more source
Quantum walk search on the complete bipartite graph [PDF]
Physical Review A, 2018 The coined quantum walk is a discretization of the Dirac equation of relativistic quantum mechanics, and it is the basis of many quantum algorithms.
Mason L. Rhodes, T. G. Wong
semanticscholar +1 more source
The local weak limit of the minimum spanning tree of the complete graph [PDF]
, 2013 Assign i.i.d. standard exponential edge weights to the edges of the complete graph K_n, and let M_n be the resulting minimum spanning tree. We show that M_n converges in the local weak sense (also called Aldous-Steele or Benjamini-Schramm convergence ...
L. Addario-Berry +3 more
semanticscholar +1 more source
TwoPaCo: an efficient algorithm to build the compacted de Bruijn graph from many complete genomes [PDF]
Bioinform., 2016 Motivation: de Bruijn graphs have been proposed as a data structure to facilitate the analysis of related whole genome sequences, in both a population and comparative genomic settings.
I. Minkin, Son K. Pham, P. Medvedev
semanticscholar +1 more source