Results 41 to 50 of about 57,717 (241)
Governance rules for managing smart city information
Urban Governance, 2022 Collecting, processing, and distributing information has always been a core function of government. This core function has evolved from the earliest ancient governments using clay tablets to today's smart cities relying on integrated data exchanges (IDE).
David Landsbergen +2 more
doaj +1 more source
On eigenvalue multiplicity and the girth of a graph [PDF]
, 2011 Suppose that G is a connected graph of order n and girth g<n. Let k be the multiplicity of an eigenvalue μ of G. Sharp upper bounds for k are n-g+2 when μ∈{-1,0}, and n-g otherwise.
Rowlinson, Peter +2 more
core +1 more source
American Journal of Neuroradiology, 2014 It is now official: We Americans are no longer the heaviest in the Western World. This ignominious claim belongs south of the border, to Mexico. The obesity rate of Mexicans (32.8%) has now surpassed that of Americans (31.8%).
openaire +2 more sources
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
Large girth approximate Steiner triple systems [PDF]
Journal of the London Mathematical Society, 2018 In 1973, Erdős asked whether there are n ‐vertex partial Steiner triple systems with arbitrary high girth and quadratically many triples. (Here girth is defined as the smallest integer g⩾4 for which some g ‐element vertex‐set contains at least g−2 ...
T. Bohman, L. Warnke
semanticscholar +1 more source
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
The Effect of Girth Design and Girth Tension on Saddle-Horse Pressures and Forelimb Stride Kinematics in Rising Trot. [PDF]
Animals (Basel)The aim of this study was to investigate the effect of girth design and girth tension; six horses regularly ridden were used. Each horse underwent four experimental sessions in an unbalanced Latin-square design with two girth tensions (8 kg or 16 kg) and
Marlin D, Randell O, Mayhew E, Blake R.
europepmc +4 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