Results 21 to 30 of about 2,700 (119)
Coloring, sparseness and girth [PDF]
Israel Journal of Mathematics, 2016 An $r$-augmented tree is a rooted tree plus $r$ edges added from each leaf to ancestors. For $d,g,r\in\mathbb{N}$, we construct a bipartite $r$-augmented complete $d$-ary tree having girth at least $g$. The height of such trees must grow extremely rapidly in terms of the girth. Using the resulting graphs, we construct sparse non-$k$-choosable bipartite
Alon, Noga +4 more
openaire +2 more sources
Ars Mathematica Contemporanea, 2023 Summary: Let \(\Gamma\) denote a finite, connected, simple graph. For an edge \(e\) of \(\Gamma\) let \(n(e)\) denote the number of girth cycles containing \(e\). For a vertex \(v\) of \(\Gamma\) let \(\{e_1, e_2, \dots, e_k\}\) be the set of edges incident to \(v\) ordered such that \(n(e_1) \leq n(e_2) \leq \cdots \leq n(e_k)\). Then \((n(e_1), n(e_2)
Kiss, György +2 more
openaire +4 more sources
On Some Properties of Antipodal Partial Cubes
Discussiones Mathematicae Graph Theory, 2020 We prove that an antipodal bipartite graph is a partial cube if and only it is interval monotone. Several characterizations of the principal cycles of an antipodal partial cube are given.
Polat Norbert
doaj +1 more source
, 2015 We show that the abelian girth of a graph is at least three times its girth. We prove an analogue of the Moore bound for the abelian girth of regular graphs, where the degree of the graph is fixed and the number of vertices is large. We conclude that one could try to improve the Moore bound for graphs of fixed degree and many vertices by trying to ...
Friedman, Joel +2 more
openaire +2 more sources
IEEE Access, 2021 Multitype quasi-cyclic (QC) low-density parity-check (LDPC) codes are a class of protograph LDPC codes lifted cyclically from protographs with multiple edges, represented by two weight and slope matrices.
Farzaneh Abedi, Mohammad Gholami
doaj +1 more source
Discrete Applied Mathematics, 2010 this paper has been withdrawn because it has been ...
Siham Bekkai, Mekkia Kouider
openaire +2 more sources
Modèle de croissance pour les plantations de mélèzes [PDF]
Biotechnologie, Agronomie, Société et Environnement, 2003 Growth model forlarch in pure and even-aged stands. Adistance independent tree growth model has been determined forpure and even-aged larch stands (Larix sp.) growing in Walloon Region (South Belgium).
Rondeux J., Lejeune P., Pauwels D.
doaj
Ars Mathematica Contemporanea, 2019 20 pages, 6 ...
Primoz Potocnik, Janos Vidali
openaire +5 more sources
Girth-Based Sequential-Recovery LRCs
IEEE Access, 2022 In this paper, we prove that a linear block code with girth $2(t+1)$ is a $t$ -sequential-recovery locally repairable codes (LRCs) with locality $r$ if its parity-check matrix has column weight at least 2 and row weight at most $r+1$ . This gives a
Zhi Jing, Hong-Yeop Song
doaj +1 more source
Spectra of Orders for k-Regular Graphs of Girth g
Discussiones Mathematicae Graph Theory, 2021 A (k, g)-graph is a k-regular graph of girth g. Given k ≥ 2 and g ≥ 3, infinitely many (k, g)-graphs of infinitely many orders are known to exist. Our goal, for given k and g, is the classification of all orders n for which a (k, g)-graph of order n ...
Jajcay Robert, Raiman Tom
doaj +1 more source