Results 21 to 30 of about 732,643 (255)
Ricci Curvature on Birth-Death Processes
Axioms, 2023 In this paper, we study curvature dimension conditions on birth-death processes which correspond to linear graphs, i.e., weighted graphs supported on the infinite line or the half line. We give a combinatorial characterization of Bakry and Émery’s CD(K,n)
Bobo Hua, Florentin Münch
doaj +1 more source
Unfolding of Finite Concurrent Automata [PDF]
Electronic Proceedings in Theoretical Computer Science, 2018 We consider recognizable trace rewriting systems with level-regular contexts (RTL). A trace language is level-regular if the set of Foata normal forms of its elements is regular. We prove that the rewriting graph of a RTL is word-automatic.
Alexandre Mansard
doaj +1 more source
A new class of graceful graphs: k-enriched fan graphs and their characterisations
Cubo, 2021 The Graceful Tree Conjecture stated by Rosa in the mid 1960s says that every tree can be gracefully labelled. It is one of the best known open problems in Graph Theory.
M. Haviar, S. Kurtulík
doaj +1 more source
Unavoidable topological minors of infinite graphs [PDF]
, 2010 This is the post-print version of the Article - Copyright @ 2010 ElsevierA graph G is loosely-c-connected, or ℓ-c-connected, if there exists a number d depending on G such that the deletion of fewer than c vertices from G leaves precisely one infinite ...
Ding, Guoli +5 more
core +1 more source
Graphs whose vertex set can be partitioned into a total dominating set and an independent dominating set [PDF]
Opuscula MathematicaA graph \(G\) whose vertex set can be partitioned into a total dominating set and an independent dominating set is called a TI-graph. We give constructions that yield infinite families of graphs that are TI-graphs, as well as constructions that yield ...
Teresa W. Haynes, Michael A. Henning
doaj +1 more source
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
The Rigidity of Infinite Graphs II [PDF]
, 2022 Inductive constructions are established for countably infinite simple graphs which have minimally rigid locally generic placements in R^2. This generalises a well-known result of Henneberg for generically rigid finite graphs.
Kitson, Derek, Power, Stephen
core +2 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
Spectral Theory of Infinite Quantum Graphs [PDF]
, 2018 We investigate quantum graphs with infinitely many vertices and edges without the common restriction on the geometry of the underlying metric graph that there is a positive lower bound on the lengths of its edges. Our central result is a close connection
Kostenko, Aleksey +8 more
core +1 more source
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