Results 21 to 30 of about 17,191 (264)

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   +1 more source

On Transmission Irregular Cubic Graphs of an Arbitrary Order

Mathematics, 2022
The transmission of a vertex v of a graph G is the sum of distances from v to all the other vertices of G. A transmission irregular graph (TI graph) has mutually distinct vertex transmissions.
Anatoly Yu. Bezhaev, Andrey A. Dobrynin
doaj   +1 more source

Infinite Random Geometric Graphs [PDF]

Annals of Combinatorics, 2011
17 pages, 4 ...
Bonato, Anthony, Janssen, Jeannette
openaire   +3 more sources

Characterising memory in infinite games [PDF]

Logical Methods in Computer Science
This paper is concerned with games of infinite duration played over potentially infinite graphs. Recently, Ohlmann (LICS 2022) presented a characterisation of objectives admitting optimal positional strategies, by means of universal graphs: an objective ...
Antonio Casares, Pierre Ohlmann
doaj   +1 more source

Generating Infinite Random Graphs [PDF]

Proceedings of the Edinburgh Mathematical Society, 2018
AbstractWe define a growing model of random graphs. Given a sequence of non-negative integers {dn}n=0∞ with the property that di≤i, we construct a random graph on countably infinitely many vertices v0, v1… by the following process: vertex vi is connected to a subset of {v0, …, vi−1} of cardinality di chosen uniformly at random.
Biró, Csaba, Darji, Udayan B.
openaire   +2 more sources

Isospectral reduction in infinite graphs [PDF]

Journal of Spectral Theory, 2020
L. A. Bunimovich and B. Z. Webb developed a theory for transforming a finite weighted graph while preserving its spectrum, referred as isospectral reduction theory. In this workwe extend this theory to a class of operators on Banach spaces that include Markov type operators.
Duarte, Pedro, Torres, M. J.
openaire   +3 more sources

An introduction of F-graphs, a graph-theoretic representation of natural numbers

International Journal of Mathematics and Mathematical Sciences, 1992
A special type of family graphs (F-graphs, for brevity) are introduced. These are cactus-type graphs which form infinite families under an attachment operation. Some of the characterizing properties of F-graphs are discussed.
E. J. Farrell
doaj   +1 more source

Note on robust coloring of planar graphs [PDF]

Opuscula Mathematica
We consider the robust chromatic number \(\chi_1(G)\) of planar graphs \(G\) and show that there exists an infinite family of planar graphs \(G\) with \(\chi_1(G) = 3\), thus solving a recent problem of Bacsó et al.
František Kardoš, Borut Lužar, Roman Soták   +2 more
doaj   +1 more source

On P-transitive graphs and applications [PDF]

Electronic Proceedings in Theoretical Computer Science, 2011
We introduce a new class of graphs which we call P-transitive graphs, lying between transitive and 3-transitive graphs. First we show that the analogue of de Jongh-Sambin Theorem is false for wellfounded P-transitive graphs; then we show that the mu ...
Giacomo Lenzi
doaj   +1 more source

Classes of graphs with restricted interval models [PDF]

Discrete Mathematics & Theoretical Computer Science, 1999
We introduce q-proper interval graphs as interval graphs with interval models in which no interval is properly contained in more than q other intervals, and also provide a forbidden induced subgraph characterization of this class of graphs.
Andrzej Proskurowski, Jan Arne Telle
doaj   +2 more sources