Results 81 to 90 of about 2,700 (119)
Some of the next articles are maybe not open access.
Journal of Graph Theory, 2002
AbstractFor each fixed k ≥ 0, we give an upper bound for the girth of a graph of order n and size n + k. This bound is likely to be essentially best possible as n → ∞. © 2002 Wiley Periodicals, Inc.
Béla Bollobás, Endre Szemerédi
openaire +2 more sources
AbstractFor each fixed k ≥ 0, we give an upper bound for the girth of a graph of order n and size n + k. This bound is likely to be essentially best possible as n → ∞. © 2002 Wiley Periodicals, Inc.
Béla Bollobás, Endre Szemerédi
openaire +2 more sources
Journal of Graph Theory, 1989
AbstractLet G be 2‐connected graph with girth g and minimum degree d. Then each pair of vertices of G is joined by a path of length at least max{1/2(d − 1)g, (d − 3/2)(g − 4) + 2} if g ⩾ 4, and the length of a longest cycle of G is at least max{[(d − 1)(g − 2) + 2], [(2d − 3)(g − 4) + 4]}.
openaire +2 more sources
AbstractLet G be 2‐connected graph with girth g and minimum degree d. Then each pair of vertices of G is joined by a path of length at least max{1/2(d − 1)g, (d − 3/2)(g − 4) + 2} if g ⩾ 4, and the length of a longest cycle of G is at least max{[(d − 1)(g − 2) + 2], [(2d − 3)(g − 4) + 4]}.
openaire +2 more sources
Comparison of girth materials, girth tensions and their effects on performance in racehorses
Australian Veterinary Journal, 2005ObjectiveTo compare the effect of girth materials and commonly used girth tensions on athletic performance of racehorses and to test the length tension properties of commercially available girths.ProcedureSeven horses were exercised at speeds to produce 95% of maximal heart rates on 15 occasions using a randomised block design, and girthed with 5 ...
J, Bowers, R F, Slocombe
openaire +2 more sources
Girth and Total Domination in Graphs
Graphs and Combinatorics, 2011zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Michael A. Henning, Anders Yeo
openaire +2 more sources
A note on the girth of digraphs
Combinatorica, 1982Behzad, Chartrand and Wall conjectured that the girth of a diregular graph of ordern and outdegreer is not greater than [n /r]. This conjecture has been proved forr=2 by Behzad and forr=3 by Bermond. We prove that a digraph of ordern and halfdegree ≧4 has girth not exceeding [n / 4]. We also obtain short proofs of the above results.
openaire +2 more sources
Combinatorica, 1988
Let \(\Gamma\) be any finite connected graph that admits a group of automorphisms acting transitively on the set of ordered pairs of adjacent vertices. Let v and w be adjacent vertices, A the stabilizer of v, and B the stabilizer of \(\{\) v,w\(\}\). The pair (A,B) is the symmetry type of \(\Gamma\), introduced by \textit{D. Z.
openaire +1 more source
Let \(\Gamma\) be any finite connected graph that admits a group of automorphisms acting transitively on the set of ordered pairs of adjacent vertices. Let v and w be adjacent vertices, A the stabilizer of v, and B the stabilizer of \(\{\) v,w\(\}\). The pair (A,B) is the symmetry type of \(\Gamma\), introduced by \textit{D. Z.
openaire +1 more source
A High Girth Graph Construction
SIAM Journal on Discrete Mathematics, 2003Summary: We give a deterministic algorithm that constructs a graph of girth \(\log_{k}(n) + O(1)\) and minimum degree \(k-1\), taking number of nodes \(n\) and number of edges \(e =\lfloor nk / 2\rfloor\) (where \(k < \frac{n}{3}\)) as input. The degree of each node is guaranteed to be \(k-1\), \(k\), or \(k+1\), where \(k\) is the average degree ...
openaire +2 more sources
Simplicial Girth and Pure Resolutions
Graphs and Combinatorics, 2011zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +1 more source
Health Sociology Review, 2008
AbstractThe current preoccupation with body weight in western cultures is arguably unprecedented.
openaire +1 more source
AbstractThe current preoccupation with body weight in western cultures is arguably unprecedented.
openaire +1 more source