We introduce a curvature function for planar graphs to study the connection between the curvature and the geometric and spectral properties of the graph. We show that non-positive curvature implies that the graph is infinite and locally similar to a tessellation. We use this to extend several ...
Journal of the Franklin InstituteToida, S. (1973) Properties of a planar cubic graph. J. Franklin Inst. 295(2) 165-174.S. TOIDA, Properties of a planar cubic graph, J. Franklin Inst. 295, No. 2 (1973), 165-174.S. Toida, Properties of a planar cubic graph, J. Franklin Inst....
26 Zeros of linear combinations of Dirichlet L-functions on the critical line 48:49 The rank of elliptic curves 40:40 A Weyl-type inequality for irreducible elements in function fields, with applica 49:34 BALOG ANTAL_ ON THE L1 NORM OF TRIGONOMETRIC POLYNOMIALS WITH MULTIPLICATIVE COE 2:03:...
Let r be an integer, f(n) a function, and H a graph. Introduced by Erd\\H{o}s, Hajnal, S\\'{o}s, and Szemer\\'edi, the r-Ramsey-Tur\\'{a}n number of H, RT_... J Balogh,J Lenz - 《Bulletin of the London Mathematical Society》 被引量: 26发表: 2011年 Baryon and ...
A metric space ( X , d ) is monotone if there is a linear order0 such that d ( x , y )≦ cd ( x , z ) for all x < y < z ∈ X . Properties of continuous functions with monotone graph (considered as a planar set) are investigated. It is shown, for example, that such ...
PlanarGraph RasterBand RasterCatalog RasterDataset RelationshipClass RepresentationClass SchematicDataset Table Text TIN Tool Toolbox Topology Terrain String DSID (Lecture seule) The ID of the dataset. Integer extent (Lecture seule) The Extent object. Remarque : extent is available for spatial datasets ...
A 1-planar graph is a graph that can be embedded in the plane with at most one crossing per edge. It is known that testing 1-planarity of a graph is NP-com... P Eades,SH Hong,N Katoh,... - 《Theoretical Computer Science》 被引量: 51发表: 2013年 A characterization of level pla...
An efficient parallel algorithm is given for constructing the arrangement of n line segments in the plane, i.e., the planar graph determined by the segment endpoints and intersections. This algorithm is efficient relative to three effici... D Eppstein,MT Goodrich,JY Meng - International Conference...
How to make a non-planar graph planar? How does the property of Rigid Motion apply to congruence for transformations? How are prisms and pyramids alike? Working in the symmetry group of the regular n-gon, how many solutions does the equation x^2 = e have? What about the equation...
The famous, yet unsolved, Fermi-Hubbard model for strongly-correlated electronic systems is a prominent target for quantum computers. However, accurately representing the Fermi-Hubbard ground state for large instances may be beyond the reach of near-term quantum hardware. Here we show experimentally ...