Results 61 to 70 of about 2,125,495 (197)
, 2010 A graph that admits a Smarandachely near mean m-labeling is called Smarandachely near m-mean graph. The graph that admits a near mean labeling is called a near mean graph (NMG)
Nagarajan, A. +2 more
core +1 more source
Shoreline, Lake Victoria, vector polygon, ~2015
Shoreline, Lake Victoria, vector polygon, ~2015 Reference Information and Units: Projection: ESRI:102024 (http://spatialreference.org/) GCS: WGS 1984 Resolution: 1:25:000 File Naming Convention: LakeVictoriaShoreline.shp Data Origin ...
Hamilton, Stuart
core +2 more sources
The Effect of Structure Building Small Mammals in a Shifting Arctic Landscape
Ecology and EvolutionLandscapes are undergoing ecological changes, and how organisms interact with changing habitats has implications for zoogeochemical influences on ecosystem function (processes and properties). This may be especially true for organisms that alter nutrient
Austin Roy, Jennie R. McLaren
doaj +1 more source
Hystrix, the Italian Journal of Mammalogy, 1997 <strong>Abstract</strong> In autumn 1992 two subadult males, reared in captivity, were radio-tagged and released on the northern slopes of Monte Carso near the city of Trieste. The annual mean size of the home range resulted to be 38.5 ha by
Walter Pandini, Claudio Cesaris
doaj +1 more source
Homogeneous Graphs and Regular Near Polygons
Journal of Combinatorial Theory, Series B, 1994 A homogeneous graph \(\Gamma\) is defined: for every edge \(uv\), and vertex \(x\), the number of edges from \(x\) to \(\Gamma_ i(u)\cap\Gamma_ j(v)\) depends only on \(i\), \(j\) and the distances from \(x\) to \(u\) and \(v\). (\(\Gamma_ i(u)\) is the set of vertices of distance \(i\) from \(u\).) It is proven that, for distance-regular graphs in ...
openaire +3 more sources
A Higman-Haemers Inequality for Thick Regular Near Polygons [PDF]
Journal of Algebraic Combinatorics, 2004 Let \(\Gamma\) be a generalized \(n\)-gon of order \((s, t)\) (i.e. on every line there are exactly \(s+1\) points and every point lies on \(t+1\) lines). W. Feit and D. G. Higman showed that, apart from the ordinary polygons, finite examples only exist for \(n = 3, 4, 6, 8\) or \(12\). If \(s>1\) and \(t>1\), then \(n = 12\) is not possible.
Hiraki, A, Koolen, J
openaire +3 more sources
Computing in Geometry and TopologyGiven a convex region \(C\) and a set of simple polygons with associated profits, the Maximum Polygon Packing Problem seeks a non-overlapping packing of a subset of the polygons (without rotations) into \(C\), such that the total profit of the packed ...
Alkan Atak +6 more
doaj +1 more source
The valuations of the near polygon G\(_{n}\)
Electron. J. Comb., 2009 The author classifies the valuations of the near polygon \(\mathbb{G}_n\). A \textit{near polygon} is a point-line incidence geometry such that two points determine at most one line, and for each point \(p\) and line \(L\), there is a unique point on \(L\) nearest to \(p\) in the point collinearity graph.
openaire +3 more sources
The Universal Embedding of the Near Polygon ${\Bbb G}_n$ [PDF]
The Electronic Journal of Combinatorics, 2007 In an earlier paper, we showed that the dual polar space $DH(2n-1,4)$, $n \geq 2$, has a sub near-$2n$-gon ${\Bbb G}_n$ with a large automorphism group. In this paper, we determine the absolutely universal embedding of this near polygon. We show that the generating and embedding ranks of ${\Bbb G}_n$ are equal to ${2n \choose n}$. We also show that the
openaire +1 more source
, 2002 The main concern of this book is the study of Smarandache analogue properties of near-rings and Smarandache near-rings; so it does not promise to cover all concepts or the proofs of all ...
Vasantha, Kandasamy
core +1 more source