Results 1 to 10 of about 104,914 (147)
Design of Low-Density Parity-Check Code Pair for Joint Source-Channel Coding Systems Based on Graph Theory. [PDF]
Entropy (Basel), 2023 In this article, a graph-theoretic method (taking advantage of constraints among sets associated with the corresponding parity-check matrices) is applied for the construction of a double low-density parity-check (D-LDPC) code (also known as LDPC code ...
Lv Y, He J, Xu W, Wang L.
europepmc +2 more sources
Extremal Graph Theory for Metric Dimension and Girth [PDF]
, 2012 6 ...
Mohsen Jannesari
openaire +3 more sources
Prime Graph over Cartesian Product over Rings and Its Complement
JTAM (Jurnal Teori dan Aplikasi Matematika), 2023 Graph theory is a branch of algebra that is growing rapidly both in concept and application studies. This graph application can be used in chemistry, transportation, cryptographic problems, coding theory, design communication network, etc.
Farah Maulidya Fatimah +2 more
doaj +2 more sources
Barekeng, 2022 One of the concepts in mathematics that developing rapidly today is Graph Theory. The development of Graph Theory has been combined with Group Theory, that is by representing a group in a graph.
Dewi Santri Ramdani +2 more
doaj +2 more sources
The 4-girth-thickness of the complete multipartite graph [PDF]
Electronic Journal of Graph Theory and Applications, 2019 The $g$-girth-thickness $\theta(g,G)$ of a graph $G$ is the smallest number of planar subgraphs of girth at least $g$ whose union is $G$. In this paper, we calculate the $4$-girth-thickness $\theta(4,G)$ of the complete $m$-partite graph $G$ when each ...
Rubio-Montiel, Christian
core +2 more sources
On almost hypohamiltonian graphs [PDF]
Discrete Mathematics & Theoretical Computer Science, 2019 A graph $G$ is almost hypohamiltonian (a.h.) if $G$ is non-hamiltonian, there exists a vertex $w$ in $G$ such that $G - w$ is non-hamiltonian, and $G - v$ is hamiltonian for every vertex $v \ne w$ in $G$. The second author asked in [J.
Jan Goedgebeur, Carol T. Zamfirescu
doaj +6 more sources
On Weakly 2-Invo Clean Rings With Some Properties in Graph Theory
International Journal of Mathematics and Mathematical SciencesThe concept of a weakly two-involution clean ring is presented; it is a generalization of two-involution clean ring, which allows the addition of more elements to a ring, which will be observed in its graph theoretic representation.
Salim Ghadeer Salim +2 more
doaj +2 more sources
The Quantum Approximate Optimization Algorithm at High Depth for MaxCut on Large-Girth Regular Graphs and the Sherrington-Kirkpatrick Model [PDF]
Theory of Quantum Computation, Communication, and Cryptography, 2021 The Quantum Approximate Optimization Algorithm (QAOA) finds approximate solutions to combinatorial optimization problems. Its performance monotonically improves with its depth $p$. We apply the QAOA to MaxCut on large-girth $D$-regular graphs. We give an
J. Basso +4 more
semanticscholar +1 more source
A lower bound for the complex flow number of a graph: A geometric approach [PDF]
Journal of Graph Theory, 2023 Let r≥2 $r\ge 2$ be a real number. A complex nowhere‐zero r $r$ ‐flow on a graph G $G$ is an orientation of G $G$ together with an assignment φ:E(G)→C $\varphi :E(G)\to {\mathbb{C}}$ such that, for all e∈E(G) $e\in E(G)$ , the Euclidean norm of the ...
D. Mattiolo +3 more
semanticscholar +1 more source
The missing Moore graph as an optimization problem
EURO Journal on Computational Optimization, 2023 It has been an open question for 6 decades whether a Moore graph of diameter 2 and degree 57 exists. In this paper the question is posed as an optimization problem and an algorithm is described.
Derek H. Smith, Roberto Montemanni
doaj +1 more source