Results 1 to 10 of about 16,859 (164)
A GRAPH ASSOCIATED TO ESPECIAL ESSENTIALITY OF SUBMODULES [PDF]
Journal of Algebraic Systems, 2023 Let $R$ be an associative ring with identity. In this paper weassociate to every $R$-module $M$ a simple graph $\Gamma_e(M)$, which we call it the essentiality graph of $M$.
Mehdi Ebrahimi Dorcheh, Saeid Bagheri
doaj +1 more source
ON THE GIRTH, INDEPENDENCE NUMBER, AND WIENER INDEX OF COPRIME GRAPH OF DIHEDRAL GROUP
Barekeng, 2023 The coprime graph of a finite group , denoted by , is a graph with vertex set such that two distinct vertices and are adjacent if and only if their orders are coprime, i.e., where |x| is the order of x.
Agista Surya Bawana +2 more
doaj +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
Governance rules for managing smart city information
Urban Governance, 2022 Collecting, processing, and distributing information has always been a core function of government. This core function has evolved from the earliest ancient governments using clay tablets to today's smart cities relying on integrated data exchanges (IDE).
David Landsbergen +2 more
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
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
Constructing Large Girth QC Protograph LDPC Codes Based on PSD-PEG Algorithm
IEEE Access, 2017 For a given base graph, the lifted graph can be obtained by a copy-and-permute procedure. If the permutation is cyclic, the lifted graph corresponds to a quasi-cyclic (QC) protograph low-density parity-check (LDPC) code.
Xue-Qin Jiang +3 more
doaj +1 more source