Results 11 to 20 of about 1,327,272 (305)
Journal of Mathematics, 2021 This work deals with the well-known group-theoretic graphs called coset graphs for the modular group G and its applications. The group action of G on real quadratic fields forms infinite coset graphs. These graphs are made up of closed paths. When M acts
Hanan Alolaiyan +3 more
doaj +1 more source
Approximations of Acyclic Graphs
Известия Иркутского государственного университета: Серия "Математика", 2022 In this paper, approximations of acyclic graphs are studied. It is proved that any theory of an acyclic graph (tree) of finite diameter is pseudofinite with respect to acyclic graphs (trees), that is, any such theory is approximated by theories of finite
N.D. Markhabatov
doaj +1 more source
Infinite limits and folding [PDF]
Discrete Mathematics & Theoretical Computer Science, 2005 We study infinite limits of graphs generated by the duplication model for biological networks. We prove that with probability 1, the sole nontrivial connected component of the limits is unique up to isomorphism. We describe certain infinite deterministic
Anthony Bonato, Jeannette Janssen
doaj +1 more source
Graphoidally independent infinite graphs
AKCE International Journal of Graphs and Combinatorics, 2021 A graphoidal cover of a graph G (not necessarily finite) is a collection ψ of paths in G, called ψ-edges, (not necessarily finite, not necessarily open) satisfying the following axioms: (GC-1) Every vertex of G is an internal vertex of at most one path ...
Purnima Gupta, Deepti Jain
doaj +1 more source
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
Spectra of infinite graphs via freeness with amalgamation [PDF]
Canadian Journal of Mathematics - Journal Canadien de Mathematiques, 2019 We use tools from free probability to study the spectra of Hermitian operators on infinite graphs. Special attention is devoted to universal covering trees of finite graphs.
Jorge Garza Vargas, Archit Kulkarni
semanticscholar +1 more source
Controllability of periodic bilinear quantum systems on infinite graphs [PDF]
Journal of Mathematics and Physics, 2019 In this work, we study the controllability of the bilinear Schrodinger equation on infinite graphs for periodic quantum states. We consider the equation (BSE) $i\partial_t\psi = −\Delta \psi+ u(t)B\psi$ in the Hilbert space $L^2_p$ composed by functions ...
K. Ammari, Alessandro Duca
semanticscholar +1 more source
Hamilton-connectedness and Hamilton-laceability of planar geometric graphs with applications
AIMS Mathematics, 2021 In this paper, we have used two different proof techniques to show the Hamilton-connectedness of graphs. By using the vertex connectivity and Hamiltoniancity of graphs, we construct an infinite family of Hamilton-connected convex polytope line graphs ...
Suliman Khan +4 more
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