Concept
Complete graph
Related publications (67)
Metastability of the Potts Ferromagnet on Random Regular Graphs
We study the performance of Markov chains for the q-state ferromagnetic Potts model on random regular graphs. While the cases of the grid and the complete graph are by now well-understood, the case of random regular graphs has resisted a detailed analysis ...
SPRINGER2023Superior visible light-mediated catalytic activity of a novel N-doped, Fe3O4-incorporating MgO nanosheet in presence of PMS: Imidacloprid degradation and implications on simultaneous bacterial inactivation
Stefanos Giannakis, Jérémie Decker
Impressive Imidacloprid (IMD) degradation and bacterial inactivation were attained through the photocatalytic activation of peroxymonosulfate (PMS) via a novel, N-doped MgO@Fe3O4, under visible light. After complete characterization (XPS, XRD, FT-IR, FE-SE ...
ELSEVIER2022Fast Lead-Free Humidity Sensor Based on Hybrid Halide Perovskite
László Forró, Dragan Damjanovic, Endre Horvath, Alla Arakcheeva, Márton Kollár, Pavao Roko Andricevic, Trpimir Ivsic
An environmentally friendly analog of the prominent methylammonium lead halide perovskite, methylammonium bismuth bromide (MA3Bi2Br9), was prepared and investigated in the form of powder, single crystals and nanowires. Complete characterization via synchro ...
2022Recoloring subgraphs of K-2n for sports scheduling
The exploration of one-factorizations of complete graphs is the foundation of some classical sports scheduling problems. One has to traverse the landscape of such one-factorizations by moving from one of those to a so-called neighbor one-factorization. Thi ...
ELSEVIER2021Letter graphs and geometric grid classes of permutations: Characterization and recognition
In this paper, we reveal an intriguing relationship between two seemingly unrelated notions: letter graphs and geometric grid classes of permutations. An important property common for both of them is well-quasi-orderability, implying, in a non-constructive ...
ELSEVIER2020Simple Realizability of Complete Abstract Topological Graphs Simplified
An abstract topological graph (briefly an AT-graph) is a pair A = (G, X) where G = (V, E) is a graph and X. E2 is a set of pairs of its edges. The AT-graph A is simply realizable if G can be drawn in the plane so that each pair of edges from X crosses exac ...
SPRINGER2020Who Started This Rumor? Quantifying the Natural Differential Privacy of Gossip Protocols
Rachid Guerraoui, Hadrien Hendrikx
Gossip protocols (also called rumor spreading or epidemic protocols) are widely used to disseminate information in massive peer-to-peer networks. These protocols are often claimed to guarantee privacy because of the uncertainty they introduce on the node t ...
Schloss Dagstuhl, Leibniz-Zentrum2020