Results 21 to 30 of about 76,042 (299)
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
Unified bijections for maps with prescribed degrees and girth [PDF]
, 2012 This article presents unified bijective constructions for planar maps, with control on the face degrees and on the girth. Recall that the girth is the length of the smallest cycle, so that maps of girth at least $d=1,2,3$ are respectively the general ...
Bernardi, Olivier, Fusy, Eric
core +2 more sources
Journal of Combinatorial Theory, Series B, 2005 Graphs of high girth have been much studied, especially in the context of the minimum vertex number of graphs of given girth and minimum degree. The authors study the treewidth \(\text{tw}(G)\) of a graph \(G\), giving a lower bound in terms of the girth \(g(G)\) and average degree \(d(G)\). They show that \[ \text{tw}(G)\geq c {1\over g(G)+1} (d(G)-1)^
Chandran, L., Subramanian, C.
openaire +3 more sources
Genome-Wide Association Study (GWAS) for Linear Body Measurements of Sussex Cattle (Bos taurus) at Weaning and Yearling Age in South Africa. [PDF]
Vet Med SciThese results show that GWAS can be a useful tool for recognising novel loci and unravelling the genetic basis of complex economic traits. Sussex cattle exhibited candidate genes (RAB31, BIRC5, TEX22, CFAP100 and LOC617705) as potential candidate genes for linear body measurement traits, which could serve as significant marker information for genome ...
Bila L +4 more
europepmc +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
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
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
Tree-Based Construction of LDPC Codes Having Good Pseudocodeword Weights [PDF]
, 2005 We present a tree-based construction of LDPC codes that have minimum pseudocodeword weight equal to or almost equal to the minimum distance, and perform well with iterative decoding.
Kelley, Christine +2 more
core +4 more sources
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