Results 61 to 70 of about 59,293 (196)
Large-Girth Roots of Graphs [PDF]
SIAM Journal on Discrete Mathematics, 2010 14 pages, 4 ...
Anna Adamaszek, Michal Adamaszek
openaire +4 more sources
THE TRIPLE IDEMPOTENT GRAPH OF THE RING Z_n
BarekengLet be a commutative ring, and denote the set of all idempotent elements of . The triple idempotent graph of , denoted by , is defined as an undirected simple graph whose vertex set .
Vika Yugi Kurniawan +2 more
doaj +1 more source
Journal of Combinatorial Designs, EarlyView.ABSTRACT In this paper, we study and characterise the natural embedding of the twisted triality hexagon T ( q 3 , q ) ${\mathsf{T}}({q}^{3},q)$ in PG ( 7 , q 3 ) ${\mathsf{PG}}(7,{q}^{3})$. We begin by describing the possible intersections of subspaces of PG ( 7 , q 3 ) ${\mathsf{PG}}(7,{q}^{3})$ with T ( q 3 , q ) ${\mathsf{T}}({q}^{3},q)$.
Sebastian Petit, Geertrui Van de Voorde
wiley +1 more source
THE TRIPLE IDENTITY GRAPH OF THE RING Z_n
BarekengLet be a commutative ring with identity and is an identity element of . The triple identity graph of the ring , represented by ), is an undirected simple graph with the vertex set .
Vika Yugi Kurniawan +2 more
doaj +1 more source
Near-colorings: non-colorable graphs and NP-completeness [PDF]
, 2013 A graph G is (d_1,..,d_l)-colorable if the vertex set of G can be partitioned into subsets V_1,..,V_l such that the graph G[V_i] induced by the vertices of V_i has maximum degree at most d_i for all 1
Montassier, Mickael, Ochem, Pascal
core
Quasi-Cyclic LDPC Codes based on Pre-Lifted Protographs
, 2014 Quasi-cyclic low-density parity-check (QC-LDPC) codes based on protographs are of great interest to code designers because analysis and implementation are facilitated by the protograph structure and the use of circulant permutation matrices for ...
Costello Jr, Daniel J. +2 more
core +1 more source
Treewidth Versus Clique Number. V. Further Connections With Tree‐Independence Number
Journal of Graph Theory, EarlyView.ABSTRACT We continue the study of ( tw , ω ) $({\mathsf{tw}},\omega )$‐bounded graph classes, that is, hereditary graph classes in which large treewidth is witnessed by the presence of a large clique, and the relation of this property to boundedness of the tree‐independence number, a graph parameter introduced independently by Yolov in 2018 and by ...
Claire Hilaire +2 more
wiley +1 more source
Type-II QC-LDPC Codes From Multiplicative Subgroup of Prime Field
IEEE Access, 2020 A quasi-cyclic (QC) low-density parity-check (LDPC) code is called type-II, if the maximum weight over all circulants appearing in the parity-check matrix has the value of two. On the basis of multiplicative subgroup analysis for the prime field, a novel
Guohua Zhang +4 more
doaj +1 more source
Deterministic Constructions for Large Girth Protograph LDPC Codes
, 2013 The bit-error threshold of the standard ensemble of Low Density Parity Check (LDPC) codes is known to be close to capacity, if there is a non-zero fraction of degree-two bit nodes.
Pradhan, Asit Kumar +2 more
core +1 more source
Signed Projective Cubes, a Homomorphism Point of View
Journal of Graph Theory, EarlyView.ABSTRACT The (signed) projective cubes, as a special class of graphs closely related to the hypercubes, are on the crossroad of geometry, algebra, discrete mathematics and linear algebra. Defined as Cayley graphs on binary groups, they represent basic linear dependencies.
Meirun Chen +2 more
wiley +1 more source