Results 21 to 30 of about 279,078 (329)
Seidel Integral Complete Split Graphs [PDF]
Mathematics Interdisciplinary Research, 2019 In the paper we consider a generalized join operation, that is, the H-join on graphs where H is an arbitrary graph. In terms of Seidel matrix of graphs we determine the Seidel spectrum of the graphs obtained by this operation on regular graphs.
Pavel Hic +2 more
doaj +1 more source
Schreier graphs of the Basilica group [PDF]
, 2010 With any self-similar action of a finitely generated group $G$ of automorphisms of a regular rooted tree $T$ can be naturally associated an infinite sequence of finite graphs $\{\Gamma_n\}_{n\geq 1}$, where $\Gamma_n$ is the Schreier graph of the action ...
D'Angeli, Daniele +3 more
core +5 more sources
Infinite families of asymmetric graphs
AKCE International Journal of Graphs and Combinatorics, 2020 A graph G is asymmetric if its automorphism group of vertices is trivial. Asymmetric graphs were introduced by Erdős and Rényi in 1963. They showed that the probability of a graph on n vertices being asymmetric tends to 1 as n tends to infinity.
Alejandra Brewer +5 more
doaj +1 more source
Infinite Locally Random Graphs [PDF]
Internet Mathematics, 2006 Motivated by copying models of the web graph, Bonato and Janssen [Bonato and Janssen 03] introduced the following simple construction: given a graph G, for each vertex x and each subset X of its closed neighborhood, add a new vertex y whose neighbors are exactly X. Iterating this construction yields a limit graph ↑G. Bonato and Janssen claimed that the
Charbit, Pierre, Scott, Alex D.
openaire +3 more sources
Families of nested completely regular codes and distance-regular graphs [PDF]
, 2014 In this paper infinite families of linear binary nested completely regular codes are constructed. They have covering radius $\rho$ equal to $3$ or $4$, and are $1/2^i$-th parts, for $i\in\{1,\ldots,u\}$ of binary (respectively, extended binary) Hamming ...
Borges, J., Rifà, J., Zinoviev, V. A.
core +5 more sources
Distinguishing homomorphisms of infinite graphs [PDF]
, 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 +3 more sources
Characterising memory in infinite games [PDF]
Logical Methods in Computer ScienceThis 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
Infinite Random Geometric Graphs [PDF]
Annals of Combinatorics, 2011 17 pages, 4 ...
Bonato, Anthony, Janssen, Jeannette
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
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