Results 1 to 10 of about 3,071,055 (213)
Strongly Closed Subgraphs in a Regular Thick Near Polygon [PDF]
European Journal of Combinatorics, 1999 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Hiraki, Akira
exaly +5 more sources
The Regular Near Polygons of Order (s, 2) [PDF]
Journal of Algebraic Combinatorics, 2004 A near polygon is a partial linear space \({\mathcal S}=({\mathcal P},{\mathcal L})\) with the property that for every point \(p\in {\mathcal P}\) and for every line \(L\in {\mathcal L}\) there exists a unique point on \(L\) nearest to \(p\). Here distances \(d\) are measured in the collinearity graph \(\Gamma\). If \(n=\text{ diam}(\Gamma)\), then \({\
Jack Koolen
exaly +3 more sources
An inequality for regular near polygons [PDF]
European Journal of Combinatorics, 2005 Let $G$ denote a near-polygon distance-regular graph with diameter $d\geq 3$, valency $k$ and intersection numbers $a_1>0$, $c_2>1$. Let $θ_1$ denote the second largest eigenvalue for the adjacency matrix of $G$. We show $θ_1$ is at most $(k-a_1-c_2)/(c_2-1)$.
Paul M. Terwilliger, Chih-Wen Weng
openaire +4 more sources
The principles of complexed multi-scale geodynamic monitoring of natural and technogenic processes [PDF]
E3S Web of Conferences, 2019 The principles of complexed geodynamic monitoring on the basis of long-term experience and research results of natural and man-made processes in the uranium deposits of the Streltsovsky ore province are proposed.
Anikin Pavel +3 more
doaj +1 more source
On m-ovoids of regular near polygons [PDF]
Designs, Codes and Cryptography, 2017 We generalise the work of Segre (1965), Cameron - Goethals - Seidel (1978), and Vanhove (2011) by showing that nontrivial $m$-ovoids of the dual polar spaces $DQ(2d, q)$, $DW(2d-1,q)$ and $DH(2d-1,q^2)$ ($d\ge 3$) are hemisystems. We also provide a more general result that holds for regular near polygons.
John Bamberg +2 more
openaire +4 more sources
Post fire vegetation monitoring system using Google Earth Engine
Biodiversidade Brasileira, 2019 Using Google Earth Engine, our team built a Post Wildfire Vegetation Monitoring System. This system provides land managers regular systematic updates for areas burned by wildfire, including changes in vegetation cover, vegetation type, and cover of bare
Karis Rae Tenneson +5 more
doaj +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
Inequalities for regular near polygons, with applications to
European Journal of Combinatorics, 2013 We derive two sets of inequalities for regular near polygons and study the case where one or more of these inequalities become equalities. This will allow us to obtain two characterization results for dual polar spaces. Our investigation will also have implications for triple intersection numbers and m-ovoids in regular near polygons. In particular, we
De Bruyn, Bart, Vanhove, Frédéric
openaire +4 more sources
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
The circular loxodromic lines of the torus – Brunelleschi's constructive principle?
Disegnare con, 2015 The umbrella vault of Pazzi Chapel in Santa Croce church in Florence has been the subject of many, 3d survey based researches, but it’s shape has never been described in satisfactory manner.
Nevena Radojevic
doaj