Results 61 to 70 of about 57,717 (241)
Asymptotics in percolation on high‐girth expanders [PDF]
Random Struct. Algorithms, 2018 We consider supercritical bond percolation on a family of high‐girth d ‐regular expanders. The previous study of Alon, Benjamini and Stacey established that its critical probability for the appearance of a linear‐sized (“giant”) component is pc=1/(d−1) .
Michael Krivelevich +2 more
semanticscholar +1 more source
On the Superconnectivity in graphs with odd girth g and even girth h
Electronic Notes in Discrete Mathematics, 2009 A maximally connected graph G of minimum degree δ is said to be superconnected (for short super-κ) if all disconnecting sets of cardinality δ are the neighborhood of some vertex of degree δ. Sufficient conditions on the diameter to guarantee that a graph of odd girth g and even girth h ≥ g + 3 is super-κ are stated. Also polarity graphs are shown to be
Luis Pedro Montejano 0001 +2 more
openaire +3 more sources
Diameter and girth of Torsion Graph
Analele Stiintifice ale Universitatii Ovidius Constanta: Seria Matematica, 2014 Let R be a commutative ring with identity. Let M be an R-module and T (M)* be the set of nonzero torsion elements. The set T(M)* makes up the vertices of the corresponding torsion graph, ΓR(M), with two distinct vertices x, y ∈ T(M)* forming an edge if ...
Rad P. Malakooti +3 more
doaj +1 more source
Journal of Combinatorial Theory, Series B, 1983 Sei \(\Gamma_a\) die Klasse der endlichen zusammenhängenden Graphen vom Minimalgrad mindestens \(a\), und sei \(\Gamma_{a,k}\) die Klasse der \(G \in \Gamma_a\) mit der Taillenweite mindestens \(k\). Satz 1: Für \(q \geq q_n\) ist jedes \(G \in \Gamma_{3,q}\) auf \(K_n\) kontrahierbar. Der Verf. führt den Begriff \(k\)-zyklisch-eckenzusammenhängend ein.
openaire +1 more source
On the acyclic disconnection and the girth
Discrete Applied Mathematics, 2015 The acyclic disconnection, (omega) over right arrow (D), of a digraph D is the maximum number of connected components of the underlying graph of D - A(D*), where D* is an acyclic subdigraph of D. We prove that (omega) over right arrow (D) >= g - 1 for every strongly connected digraph with girth g >= 4, and we show that (omega) over right arrow (D) = g -
Balbuena Martínez, Maria Camino Teófila +1 more
openaire +3 more sources
On Unicyclic Graphs with Minimum Graovac–Ghorbani Index
MathematicsIn discrete mathematics, graph theory is the study of graphs, which are mathematical structures used to model pairwise relations between objects.
Snježana Majstorović Ergotić
doaj +1 more source
, 2015 Acceptance remarks of Marjorie Girth at the annual Emory Bankruptcy Developments Journal Banquet. Professor Girth shared several memorable highlights of her professional career, as well as her brief tenure at Emory Law School in 1991, where she served as
Girth, Marjorie L.
core +1 more source
Tanner (3, 23)-Regular QC-LDPC Codes: Cycle Structure and Girth Distribution
IEEE AccessThis paper studies a class of quasi-cyclic LDPC (QC-LDPC) codes, i.e., Tanner (3, 23)-regular QC-LDPC codes of code length $23p$ with $p$ being a prime and $p \equiv 1 (\mathrm {mod} 69)$ .
Qi Wang +5 more
doaj +1 more source
A short proof of the odd-girth theorem [PDF]
, 2012 Recently, it has been shown that a connected graph Γ with d+1 distinct eigenvalues and odd-girth 2d+1 is distance-regular. The proof of this result was based on the spectral excess theorem.
Miquel Angel Fiol +3 more
core
Biometric relations of freshwater fishes of the Suaza River (Huila Department, Colombia) [PDF]
Acta Ichthyologica et Piscatoria, 2016 The knowledge of freshwater fishes in remote Andean mountains is scarce and restricted to changes of occurrence distribution along a specific gradient.
I. Tobes +3 more
doaj +3 more sources