Results 51 to 60 of about 57,717 (241)
Discrete Applied Mathematics, 2010 this paper has been withdrawn because it has been ...
Siham Bekkai, Mekkia Kouider
openaire +2 more sources
Girth, words and diameter [PDF]
, 2019 We study the girth of Cayley graphs of finite classical groups G on random sets of generators. Our main tool is an essentially best possible bound we obtain on the probability that a given word w takes the value 1 when evaluated in G in terms of the ...
Liebeck, Martin, Shalev, Aner
core +1 more source
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
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
On the girth of finitely generated groups [PDF]
, 2003 We study the notion of girth for finitely generated groups. It is proved that if the girth is ‘small’ then the group necessarily satisfies a law. A general construction is presented which provides examples of groups with infinite girth not containing ...
Akhmedov, Azer
core +1 more source
Extremal Graphs for Sombor Index with Given Parameters
Axioms, 2023 In this paper, we present the upper and lower bounds on Sombor index SO(G) among all connected graphs (respectively, connected bipartite graphs). We give some sharp lower and upper bounds on SO(G) among connected graphs in terms of some parameters ...
Wanping Zhang, Jixiang Meng, Na Wang
doaj +1 more source
Scientia Agricola, 2007 Rubber tree cultivation [Hevea brasiliensis (Willd. ex Adr. de Juss.) Muell.-Arg.] uses mostly the budding propagation method, however the expected stand uniformity due to the use of vegetative propagation is theoretical, since high variation for yield ...
Átila Bento Beleti Cardinal +2 more
doaj +1 more source
Wiener index in graphs given girth, minimum, and maximum degrees
Theory and Applications of Graphs, 2023 Let $G$ be a connected graph of order $n$. The Wiener index $W(G)$ of $G$ is the sum of the distances between all unordered pairs of vertices of $G$.
Fadekemi J. Osaye +3 more
doaj +1 more source
Characterization of classes of graphs with large general position number
AKCE International Journal of Graphs and Combinatorics, 2020 Getting inspired by the famous no-three-in-line problem and by the general position subset selection problem from discrete geometry, the same is introduced into graph theory as follows.
Elias John Thomas, Ullas Chandran S. V.
doaj +1 more source