Finally, we show that non-positive curvature implies the absence of finitely supported eigenfunctions for nearest neighbor operators.doi:10.1007/S00454-011-9333-0Matthias KellerSpringer-VerlagDiscrete & Computational GeometryM. Keller. Curvature, geometry and spectral properties of planar graphs. Dis- ...
We also use graph blow-up to give a complete classification of rings R whose graphs ${mathscr C}(R)$ are non-empty planar graphs.doi:10.1142/S0219498815500279Ye, MengWu, TongsuoLiu, QiongGuo, JinWorld Scientific Publishing CompanyJournal of Algebra & Its Applications...
Global Structural Properties IsomorphicGraphQ—test whether two graphs are the same after vertex renaming FindGraphIsomorphism—find the graph isomorphism as a list of rules AcyclicGraphQ▪BipartiteGraphQ▪ConnectedGraphQ▪EulerianGraphQ▪HamiltonianGraphQ▪PathGraphQ▪PlanarGraphQ▪TreeGraphQ...
NumberOfGraphs — number of nonisomorphic undirected graphs with vertices GraphPolynomial ▪ NumberOfDirectedGraphs ListNecklaces — list distinct necklaces NecklacePolynomial ▪ NumberOfNecklaces Cycles and Connectivity » FindCycle — find cycle in a graph HamiltonianCycle — find a Hamiltonian cycle...
Its discrete counterpart, the discrete Gaussian free field (DGFF), is also very well-known among random interface models on graphs. Given a graph, a (random) interface model is defined as a collection of (random) real heights, measuring the vertical distance between the interface and the set...
On 26 September 2022, NASA’s Double Asteroid Redirection Test (DART) mission successfully impacted Dimorphos, the natural satellite of the binary near-Earth asteroid (65803) Didymos. Numerical simulations of the impact provide a means to find the surfac
Unlike previous approaches, our study is not based on the assumption that road networks are planar graphs. Indeed, based on the a number of experiments we have performed on the road networks of the 50 United States and District of Columbia, we provide strong empirical evidence that road ...
Circular backbone colorings: On matching and tree backbones of planar graphs Discrete Applied Mathematics, Volume 251, 2018, pp. 69-82 J. Araujo,…, A. Silva View PDF An axiomatic semantics for iocos_ conformance relation Journal of Logical and Algebraic Methods in Programming, Volume 100, 20...
In this work, we analyze fundamental properties of random Apollonian networks [Zhang etal. 06, Zhou etal. 05], a popular random graph model that generates planar graphs with power-law properties. Specifically, we analyze the degree distribution, the k largest degrees, the k largest eigenvalues,...
This paper is studying the critical regime of the planar random-cluster model on $${\mathbb {Z}}^2$$ with cluster-weight $$q\in [1,4)$$ . More precisely, w