Results 61 to 70 of about 1,525,761 (361)
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
Edge- and vertex-reinforced random walks with super-linear reinforcement on infinite graphs [PDF]
, 2015 In this paper we introduce a new simple but powerful general technique for the study of edge- and vertex-reinforced processes with super-linear reinforcement, based on the use of order statistics for the number of edge, respectively of vertex, traversals.
Codina Cotar, Debleena Thacker
semanticscholar +1 more source
Countable locally 2-arc-transitive bipartite graphs [PDF]
, 2014 We present an order-theoretic approach to the study of countably infinite locally 2-arc-transitive bipartite graphs. Our approach is motivated by techniques developed by Warren and others during the study of cycle-free partial orders. We give several new
Biggs +33 more
core +3 more sources
The Ihara zeta function for infinite graphs [PDF]
Transactions of the American Mathematical Society, 2014 We put forward the concept of measure graphs. These are (possibly uncountable) graphs equipped with an action of a groupoid and a measure invariant under this action.
D. Lenz, Felix Pogorzelski, M. Schmidt
semanticscholar +1 more source
Polyhedra, Complexes, Nets and Symmetry [PDF]
, 2014 Skeletal polyhedra and polygonal complexes in ordinary Euclidean 3-space are finite or infinite 3-periodic structures with interesting geometric, combinatorial, and algebraic properties.
Schulte, Egon
core +1 more source
Topological Infinite Gammoids, and a New Menger-Type Theorem for Infinite Graphs [PDF]
Electronic Journal of Combinatorics, 2014 Answering a question of Diestel, we develop a topological notion of gammoids in infinite graphs which, unlike traditional infinite gammoids, always define a matroid.As our main tool, we prove for any infinite graph $G$ with vertex-sets $A$ and $B$, if ...
J. Carmesin
semanticscholar +1 more source
Journal of Combinatorial Theory, Series B, 1994 AbstractWe give a new proof of Aharoni′s criterion for the existence of perfect matchings in infinite graphs.
Frank Niedermeyer, Klaus-Peter Podewski
openaire +2 more sources
Star complements in signed graphs with two symmetric eigenvalues
Kuwait Journal of Science, 2022 We consider signed graphs $G$ whose spectrum is comprised of exactly two (distinct) eigenvalues that differ only in sign, abbreviated to signed graphs with two symmetric eigenvalues. We obtain some relationships between such signed graphs and their star
Assoc. Prof, Zoran Stanić
doaj +1 more source
>k-homogeneous infinite graphs
, 2017 In this article we give an explicit classification for the countably infinite graphs $\mathcal{G}$ which are, for some $k$, $\geq$$ k$-homogeneous. It turns out that a $\geq$$k-$homogeneous graph $\mathcal{M}$ is non-homogeneous if and only if it is ...
Ahlman, Ove
core +1 more source
The hyperbolicity constant of infinite circulant graphs
Open Mathematics, 2017 If X is a geodesic metric space and x1, x2, x3 ∈ X, a geodesic triangle T = {x1, x2, x3} is the union of the three geodesics [x1x2], [x2x3] and [x3x1] in X.
Rodríguez José M., Sigarreta José M.
doaj +1 more source