Results 31 to 40 of about 76,042 (299)
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
Combined numerical-experimental framework for strain based design and flaw assessment of girth welds [PDF]
, 2013 An increasing number of transmission pipelines have to be installed and operated in harsh conditions, due to the diminishing reserves of exploited fossil fuel sources.
De Waele, Wim +4 more
core +2 more sources
Counting hypergraphs with large girth [PDF]
Journal of Graph Theory, 2022 AbstractMorris and Saxton used the method of containers to bound the number of ‐vertex graphs with edges containing no ‐cycles, and hence graphs of girth more than . We consider a generalization to ‐uniform hypergraphs. The girth of a hypergraph is the minimum such that there exist distinct vertices and hyperedges with for all .
Spiro, Sam, Verstraëte, Jacques
openaire +3 more sources
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
A Breezing Proof of the KMW Bound
, 2020 In their seminal paper from 2004, Kuhn, Moscibroda, and Wattenhofer (KMW) proved a hardness result for several fundamental graph problems in the LOCAL model: For any (randomized) algorithm, there are input graphs with $n$ nodes and maximum degree $\Delta$
Coupette, Corinna, Lenzen, Christoph
core +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
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
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
The 4-girth-thickness of the complete multipartite graph
, 2019 The $g$-girth-thickness $\theta(g,G)$ of a graph $G$ is the smallest number of planar subgraphs of girth at least $g$ whose union is $G$. In this paper, we calculate the $4$-girth-thickness $\theta(4,G)$ of the complete $m$-partite graph $G$ when each ...
Rubio-Montiel, Christian
core +1 more source