A note on odd colorings of 1-planar graphs A proper coloring of a graph is odd if every non-isolated vertex has some color that appears an odd number of times on its neighborhood. This notion was re... DW Cranston,M Lafferty,ZX Song - 《Discrete Applied Mathematics》 被引量: 0发表:...
Zhang, XinWu, WeiliLiu, BinSpringer USJournal of Combinatorial OptimizationWang HJ, Wu LD, Zhang X, Wu WL, Liu B (2014) A note on the minimum number of choosability of planar graphs. J Comb Optim doi:10.1007/s10878-014-9805-2
We present an infinite family of finite planar graphs $\\{X_n\\}$ with degreeat most five and such that for some constant $c > 0$, $$ \\lambda_1(X_n) \\geqc(\\frac{\\log \\diam(X_n)}{\\diam(X_n)})^2\\,, $$ where $\\lambda_1$ denotes thesmallest non-zero ...
Drawing Planar Graphs with a Prescribed Inner Face Tamara Mchedlidze, Martin Nöllenburg, and Ignaz Rutter Institute of Theoretical Informatics, Karlsruhe Institute of Technology (KIT), Germany Abstract. Given a plane graph G (i.e., a planar graph with a fixed planar em- bedding) and a ...
Whereas the physical layout of qubits is typically used to determine the structure of the stabilizers, the qubits can be considered to be degreejvertices (DjV;j ∈ {2, 3, 4}) on more general planar graphs (Fig.1a)23. Using this picture, each stabilizer can be associated with ...
The comparing graphs of antennas in Fig.1. Full size image As a method of achieving this goal based on prior research (Fig.1C), we attempted to extend the ground plane of the antenna. As shown in Fig.1D an internal circle cut off antennas ground plane for increasing the bandwidth impeda...
The influence of times of convolutions are discussed in Supplementary Note 5. Algorithm 1 . Node attribute propagation. Graph classification: from motifs to PT performance Graph classification is applied to project motifs of a PT multigraph to its PT performance Fig. 3D. On the input side we ...
1. In this work, we implement the variational quantum factoring (VQF) algorithm9 on a superconducting quantum processor10. VQF is an algorithm for tackling an NP problem with a tunable trade off between classical and quantum computing resources, and is feasible for near-term devices. VQF uses ...
In the present work, an introduction to the contact phenomena in multibody systems is made. The different existing approaches are described, together with
A modular notebook computer has a framework with module bays for receiving CPU modules, power modules, and peripheral function modules such as floppy and hard disk drives. The framework has a built-in compressed bus and a variety of function modules which can be plugged into any one of the ...