Results 11 to 20 of about 87,555 (181)
Local classical MAX-CUT algorithm outperforms p=2 QAOA on high-girth regular graphs [PDF]
Quantum, 2021 The p-stage Quantum Approximate Optimization Algorithm (QAOAp) is a promising approach for combinatorial optimization on noisy intermediate-scale quantum (NISQ) devices, but its theoretical behavior is not well understood beyond p=1. We analyze QAOA2 for
Kunal Marwaha
semanticscholar +1 more source
4-CYCLE FREE APM LDPC CODES WITH AN EXPLICIT CONSTRUCTION [PDF]
Journal of Algebraic Systems, 2021 Recently, a class of low-density parity-check codes based on affine permutation matrices, called APM-LDPC codes, have been considered which have some advantages than quasi-cyclic (QC) LDPC codes in terms of minimum-distance, cycle distribution, and error-
Z. Gholami, M. Gholami
doaj +1 more source
Motivations and Psychological Characteristics of Men Seeking Penile Girth Augmentation
Aesthetic surgery journal, 2022 Background The popularity of penile augmentation procedures is increasing, but little is known about the motivations and psychological characteristics of men who seek these procedures. Objectives Employing valid psychological measures, the authors sought
G. Sharp +4 more
semanticscholar +1 more source
Mathematical Modelling and Control, 2021 In this paper, we study the problem of partitioning the vertex set of a planar graph with girth restriction into parts, also referred to as color classes, such that each part induces a graph with components of bounded order.
Chunyu Tian, Lei Sun
doaj +1 more source
A REDUCTION IN THE SEARCH SPACE OF QC-LDPC CODES WITH GIRTH 8 [PDF]
Journal of Algebraic Systems, 2020 In this paper, we define a structure to obtain exponent matrices of girth-8 QC-LDPC codes with column weight 3. Using the difference matrices introduced by Amirzade et al., we investigate necessary and sufficient conditions which result in a Tanner graph
F. Amirzade +2 more
doaj +1 more source
Some properties of semiregular cages [PDF]
Discrete Mathematics & Theoretical Computer Science, 2010 Graphs and ...
Camino Balbuena +2 more
doaj +1 more source
A Note on the Girth of (3, 19)-Regular Tanner’s Quasi-Cyclic LDPC Codes
IEEE Access, 2021 In this article, we study the cycle structure of (3, 19)-regular Tanner’s quasi-cyclic (QC) LDPC codes with code length $19p$ , where $p$ is a prime and $p\equiv 1~(\bmod ~57)$ , and transform the conditions for the existence of cycles of ...
Manjie Zhou +4 more
doaj +1 more source
The 6-girth-thickness of the complete graph
AKCE International Journal of Graphs and Combinatorics, 2020 The g-girth-thickness of a graph G is the minimum number of planar subgraphs of girth at least g whose union is G. In this paper, we determine the 6-girth-thickness of the complete graph Kn in almost all cases.
Héctor Castañeda-López +4 more
doaj +1 more source
Some bounds on the modified Randic index [PDF]
Kragujevac Journal of Science, 2015 In this paper, we present some new lower and upper bounds for the modified Randic index in terms of maximum, minimum degree, girth, algebraic connectivity, diameter and average distance.
Mahsa Hemmasi, Ali Iranmanesh
doaj +1 more source
Equitable Coloring of IC-Planar Graphs with Girth g ≥ 7
Axioms, 2023 An equitable k-coloring of a graph G is a proper vertex coloring such that the size of any two color classes differ at most 1. If there is an equitable k-coloring of G, then the graph G is said to be equitably k-colorable.
Danjun Huang, Xianxi Wu
doaj +1 more source