Results 11 to 20 of about 279,078 (329)
>k-homogeneous infinite graphs
Journal of Combinatorial Theory, Series B, 2018 14 pages, 2 ...
Ahlman, Ove
openaire +4 more sources
Spectral partitions on infinite graphs [PDF]
, 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 ...
Raffaella Burioni +2 more
openalex +3 more sources
Unfolding of Finite Concurrent Automata [PDF]
Electronic Proceedings in Theoretical Computer Science, 2018 We consider recognizable trace rewriting systems with level-regular contexts (RTL). A trace language is level-regular if the set of Foata normal forms of its elements is regular. We prove that the rewriting graph of a RTL is word-automatic.
Alexandre Mansard
doaj +1 more source
A new class of graceful graphs: k-enriched fan graphs and their characterisations
Cubo, 2021 The Graceful Tree Conjecture stated by Rosa in the mid 1960s says that every tree can be gracefully labelled. It is one of the best known open problems in Graph Theory.
M. Haviar, S. Kurtulík
doaj +1 more source
Directed Polymers on Infinite Graphs [PDF]
Communications in Mathematical Physics, 2021 We study the directed polymer model for general graphs (beyond $\mathbb Z^d$) and random walks. We provide sufficient conditions for the existence or non-existence of a weak disorder phase, of an $L^2$ region, and of very strong disorder, in terms of properties of the graph and of the random walk. We study in some detail (biased) random walk on various
Clément Cosco +2 more
openaire +3 more sources
Linearly bounded infinite graphs [PDF]
Acta Informatica, 2005 Linearly bounded Turing machines have been mainly studied as acceptors for context-sensitive languages. We define a natural class of infinite automata representing their observable computational behavior, called linearly bounded graphs. These automata naturally accept the same languages as the linearly bounded machines defining them. We present some of
Carayol, Arnaud, Meyer, Antoine
openaire +5 more sources
Graphs whose vertex set can be partitioned into a total dominating set and an independent dominating set [PDF]
Opuscula MathematicaA graph \(G\) whose vertex set can be partitioned into a total dominating set and an independent dominating set is called a TI-graph. We give constructions that yield infinite families of graphs that are TI-graphs, as well as constructions that yield ...
Teresa W. Haynes, Michael A. Henning
doaj +1 more source
On Ramsey-Minimal Infinite Graphs [PDF]
The Electronic Journal of Combinatorics, 2021 For fixed finite graphs $G$, $H$, a common problem in Ramsey theory is to study graphs $F$ such that $F \to (G,H)$, i.e. every red-blue coloring of the edges of $F$ produces either a red $G$ or a blue $H$. We generalize this study to infinite graphs $G$, $H$; in particular, we want to determine if there is a minimal such $F$.
Barrett, Jordan Mitchell +1 more
openaire +3 more sources
On Hamilton decompositions of infinite circulant graphs [PDF]
, 2017 The natural infinite analogue of a (finite) Hamilton cycle is a two-way-infinite Hamilton path (connected spanning 2-valent subgraph). Although it is known that every connected 2k-valent infinite circulant graph has a two-way-infinite Hamilton path ...
Bryant, Darryn +3 more
core +2 more sources
Journal of Combinatorial Theory, Series B, 1994 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Niedermeyer, F., Podewski, K.P.
openaire +1 more source