Results 71 to 80 of about 2,700 (119)
Injective coloring of planar graphs without intersecting 5-cycles
上海师范大学学报. 自然科学版An injective coloring is a vertex coloring such that any two vertices sharing a common neighbor receive distinct colors. Let χi (G) be the injective chromatic number of a graph G.
CHEN Hongyu, PAN Lina
doaj +1 more source
On the Girth of Tanner QC-LDPC Cycle Codes: An Algebraic Number Theory Approach
AxiomsTanner quasi-cyclic low-density parity-check (QC-LDPC) codes form an important family of structured LDPC codes with favorable girth properties. This paper studies the girth of Tanner (2, L)-regular QC-LDPC codes (referred to as Tanner QC-LDPC cycle codes)
Haipeng Yu +4 more
doaj +1 more source
Convolutional cylinder-type block-circulant cycle codes [PDF]
Transactions on Combinatorics, 2013 In this paper, we consider a class of column-weight two quasi-cyclic low-density paritycheck codes in which the girth can be large enough, as an arbitrary multiple of 8. Then we devote a convolutional form to these codes, such that their generator matrix
Mohammad Gholami, Mehdi Samadieh
doaj
LDPC Codes on Balanced Incomplete Block Designs: Construction, Girth, and Cycle Structure Analysis
EntropyIn this paper, we investigate the cycle structure inherent in the Tanner graphs of low-density parity-check (LDPC) codes constructed from balanced incomplete block designs (BIBDs).
Hengzhou Xu +4 more
doaj +1 more source
QC-LDPC Codes Construction by Concatenating of Circulant Matrices as Block-Columns
International Journal of Information and Communication Technology Research, 2016 In this paper a new low complexity method for constructing binary quasi-cyclic low-density parity-check (QC-LDPC) codes is introduced. In the proposed method, each block-column of the parity check matrix H is made by a circulant matrix in a way that the ...
Mohammad Hesam Tadayon +1 more
doaj
On the Ramsey number of 4-cycle versus wheel
Indonesian Journal of Combinatorics, 2016 For any fixed graphs $G$ and $H$, the Ramsey number $R(G,H)$ is the smallest positive integer $n$ such that for every graph $F$ on $n$ vertices must contain $G$ or the complement of $F$ contains $H$.
Enik Noviani, Edy Tri Baskoro
doaj
Girth-regular and edge-girth-regular graphs
, 2019 Magistrska naloga obravnava ožinsko-regularne in povezavno-ožinsko-regularne grafe. Podpis vozlišča u v grafu je k-terica celih števil, urejenih po velikosti od najmanjšega do največjega, kjer vsako število predstavlja število ožinskih ciklov, v katerih je vsebovana posamezna povezava, incidenčna z u.
openaire +1 more source
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Girth and Euclidean distortion
Geometric And Functional Analysis, 2002zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Nathan Linial, Avner Magen, Assaf Naor
openaire +1 more source
Canadian Mathematical Bulletin, 1982
AbstractLower bounds are given for the independence ratio in graphs satisfying certain girth and maximum degree requirements. In particular, the independence ratio of a graph with maximum degree Δ and girth at least six is at least (2Δ − 1)/(Δ2 + 2Δ − 1). Sharper bounds are given for cubic graphs.
Hopkins, Glenn, Staton, William
openaire +2 more sources
AbstractLower bounds are given for the independence ratio in graphs satisfying certain girth and maximum degree requirements. In particular, the independence ratio of a graph with maximum degree Δ and girth at least six is at least (2Δ − 1)/(Δ2 + 2Δ − 1). Sharper bounds are given for cubic graphs.
Hopkins, Glenn, Staton, William
openaire +2 more sources
AJN, American Journal of Nursing, 2012
Addressing obesity requires more than self-control.
openaire +2 more sources
Addressing obesity requires more than self-control.
openaire +2 more sources