Results 1 to 10 of about 1,555,658 (364)
The rigidity of infinite graphs [PDF]
Discrete & Computational Geometry, 2013 A rigidity theory is developed for the Euclidean and non-Euclidean placements of countably infinite simple graphs in R^d with respect to the classical l^p norms, for d>1 and ...
Kitson, D., Power, S. C.
core +7 more sources
Spectral partitions on infinite graphs [PDF]
Journal of Physics A: Mathematical and General, 2000 Statistical models on infinite graphs may exhibit inhomogeneous thermodynamic behaviour at macroscopic scales. This phenomenon is of geometrical origin and may be properly described in terms of spectral partitions into subgraphs with well defined ...
Alexander S +8 more
core +4 more sources
Characterizing Omega-Regularity through Finite-Memory Determinacy of Games on Infinite Graphs [PDF]
TheoretiCS, 2023 We consider zero-sum games on infinite graphs, with objectives specified as sets of infinite words over some alphabet of colors. A well-studied class of objectives is the one of $\omega$-regular objectives, due to its relation to many natural problems in
Patricia Bouyer +2 more
doaj +3 more sources
Helmholtz operators on infinite graphs [PDF]
HeliyonThe Helmholtz equation in its simplest form is Δu(a)=−k2u(a). In this note, we study a generalized discrete version of this equation on an infinite graph, by using potential-theoretic methods.
Varadha Raj Manivannan +1 more
doaj +2 more sources
Journal of Combinatorial Theory, 1967 AbstractThis expository article describes work which has been done on various problems involving infinite graphs, mentioning also a few unsolved problems or suggestions for future investigation.
C. St. J. A. Nash‐Williams
openalex +4 more sources
Canadian Journal of Mathematics, 1964 It is well known that for finite connected graphs the following are equivalent:(i)X is Euler (i.e., every vertex of X has positive even degree);(ii)X is traceable (i.e., the edges of X can be arranged in a sequence e1, . . . ,en such that ei ≠ ej if i ≠ j, and ei, ei+1 are adjacent, i = 1, . . .
Gert Sabidussi
openalex +3 more sources
Distinguishing homomorphisms of infinite graphs [PDF]
Contributions to Discrete Mathematics, 2012 We supply an upper bound on the distinguishing chromatic number of certain infinite graphs satisfying an adjacency property. Distinguishing proper $n$-colourings are generalized to the new notion of distinguishing homomorphisms. We prove that if a graph $
Bonato, Anthony, Delic, Dejan
core +5 more sources
On arithmetic infinite graphs [PDF]
Proceedings of the Japan Academy, Series A, Mathematical Sciences, 2000 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Hirofumi Nagoshi
openalex +5 more sources
On external presentations of infinite graphs [PDF]
Electronic Proceedings in Theoretical Computer Science, 2009 The vertices of a finite state system are usually a subset of the natural numbers. Most algorithms relative to these systems only use this fact to select vertices.
Christophe Morvan
doaj +7 more sources
Reconstructing infinite graphs [PDF]
Pacific Journal of Mathematics, 1974 J. A. Bondy, Robert L. Hemminger
openalex +4 more sources