نتایج جستجو برای: platonic graph
تعداد نتایج: 198813 فیلتر نتایج به سال:
dionysius is one of the most important personages in christian mystic that some of his ideas were up to now popular ideas in christian theosophy, theology and philosophy. christian doctrine and neo-platonic ideas are viewed as two main sources for his opinions; although he sometimes leans to one and the rest to another. for example, in discussion about creation, angelology and trinity he tended...
The notion of Isoperimetric Quotient (IQ) of a polyhedron has been already introduced by Polya. It is a measure that tells us how spherical is a given polyhedron. If we are given a polyhedral graph it can be drawn in a variety of ways in 3D space. As the coordinates of vertices belonging to the same face may not be co-planar the usual deenition of IQ fails. Therefore, a method based on a proper...
On microscopic scales, the crystallinity of flexible tethered or cross-linked membranes determines their mechanical response. We show that by controlling the type, number, and distribution of defects on a spherical elastic shell, it is possible to direct the morphology of these structures. Our numerical simulations show that by deflating a crystalline shell with defects, we can create elastic s...
s [of things] are complete and on earth the forms [of things] are complete, then flux and transformation become visible. 38 Zhouyi zhengyi (SSJZS), 7:1b. Translation modified slightly from Didier (1998): 294–5. John C. Didier, “In and Outside the Square,” Sino-Platonic Papers, 192, vol. 3 (September, 2009) 198 Like all of LSCQ, HNZ, and TXJ, the “Commentary” attributes a compartmentalizing, or ...
Based on a Morse-Smale structure, we study planar global attractors Af of the scalar reaction-advection-diffusion equation ut = uxx + f(x, u, ux) in one space dimension. We assume Neumann boundary conditions on the unit interval, dissipativeness of f , and hyperbolicity of equilibria. We call Af Sturm attractor because our results strongly rely on nonlinear nodal properties of Sturm type. Plana...
The G-graph Γ(G,S) is a graph from the group G generated by S ⊆ G, where the vertices are the right cosets of the cyclic subgroups 〈s〉, s ∈ S with k-edges between two distinct cosets if there is an intersection of k elements. In this thesis, after presenting some important properties of G-graphs, we show how the G-graph depends on the generating set of the group. We give the G-graphs of the sym...
Given a drawing of a graph, its visual complexity is defined as the number of geometrical entities in the drawing, for example, the number of segments in a straight-line drawing or the number of arcs in a circular-arc drawing (in 2D). Recently, Chaplick et al. [4] introduced a different measure for the visual complexity, the affine cover number, which is the minimum number of lines (or planes) ...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید