Results 31 to 40 of about 279,078 (329)
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
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
JSJ decompositions of Quadratic Baumslag-Solitar groups [PDF]
, 2011 Generalized Baumslag-Solitar groups are defined as fundamental groups of graphs of groups with infinite cyclic vertex and edge groups. Forester proved (in "On uniqueness of JSJ decompositions of finitely generated groups", Comment. Math. Helv.
Jaco +5 more
core +1 more source
Isospectral infinite graphs and networks and infinite eigenvalue multiplicities
Networks and Heterogeneous Media, 2009 We considerthe continuous Laplacian on infinite locally finite networks undernatural transition conditions as continuity at the ramificationnodes and Kirchhoff flow conditions at all vertices.
Joachim von Below, José A. Lubary
doaj +1 more source
Flip-graph moduli spaces of filling surfaces [PDF]
, 2014 This paper is about the geometry of flip-graphs associated to triangulations of surfaces. More precisely, we consider a topological surface with a privileged boundary curve and study the spaces of its triangulations with n vertices on the boundary curve.
Parlier, Hugo, Pournin, Lionel
core +1 more source
Note on robust coloring of planar graphs [PDF]
Opuscula MathematicaWe 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š +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
Proper circular arc graphs as intersection graphs of paths on a grid [PDF]
, 2018 In this paper we present a characterisation, by an infinite family of minimal forbidden induced subgraphs, of proper circular arc graphs which are intersection graphs of paths on a grid, where each path has at most one bend (turn)
Galby, Esther +2 more
core +2 more sources
Investigation of continuous-time quantum walk by using Krylov subspace-Lanczos algorithm [PDF]
, 2006 In papers\cite{js,jsa}, the amplitudes of continuous-time quantum walk on graphs possessing quantum decomposition (QD graphs) have been calculated by a new method based on spectral distribution associated to their adjacency matrix. Here in this paper, it
Aharonov +32 more
core +2 more sources