Results 41 to 50 of about 1,525,761 (361)
A random Schrödinger operator associated with the Vertex Reinforced Jump Process on infinite graphs [PDF]
Journal of The American Mathematical Society, 2015 This paper concerns the vertex reinforced jump process (VRJP), the edge reinforced random walk (ERRW), and their relation to a random Schrödinger operator.
C. Sabot, Xiaolin Zeng
semanticscholar +1 more source
Arbitrary Pattern Formation on Infinite Regular Tessellation Graphs [PDF]
International Conference of Distributed Computing and Networking, 2020 Given a set R of robots, each one located at a different vertex of an infinite regular tessellation graph, we aim to explore the Arbitrary Pattern Formation (APF) problem.
Serafino Cicerone +3 more
semanticscholar +1 more source
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
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$.
Jordan Mitchell Barrett, Valentino Vito
openaire +4 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
The center of an infinite graph
Discrete Mathematics, 1996 In this note we extend the notion of the center of a graph to infinite graphs. Thus, a vertex is in the center of the infinite graph G if it is in the center of an increasing family of finite subgraphs covering G. We give different characterizations of when a vertex is in the center of an infinite graph and we prove that any infinite graph with at ...
Boza Prieto, Luis +2 more
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
A trace on fractal graphs and the Ihara zeta function [PDF]
, 2008 Starting with Ihara's work in 1968, there has been a growing interest in the study of zeta functions of finite graphs, by Sunada, Hashimoto, Bass, Stark and Terras, Mizuno and Sato, to name just a few authors.
Guido, Daniele +2 more
core +2 more sources
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
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