Results 21 to 30 of about 1,555,658 (364)
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
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
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
An Automaton Learning Approach to Solving Safety Games over Infinite Graphs [PDF]
International Conference on Tools and Algorithms for Construction and Analysis of Systems, 2016 We propose a method to construct finite-state reactive controllers for systems whose interactions with their adversarial environment are modeled by infinite-duration two-player games over possibly infinite graphs.
D. Neider, U. Topcu
semanticscholar +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
Geometric properties of infinite graphs and the Hardy–Littlewood maximal operator [PDF]
Journal d'Analyse Mathematique, 2016 We study different geometric properties on infinite graphs, related to the weak-type boundedness of the Hardy–Littlewood maximal averaging operator. In particular, we analyze the connections between the doubling condition, having finite dilation and ...
Javier Soria, P. Tradacete
semanticscholar +1 more source
Norms, kernels and eigenvalues of some infinite graphs [PDF]
Operators and Matrices, 2018 In these paper we study the adjacency matrix of some infinite graphs, which we call the shift operator on the $L^p$ space of the graph. In particular, we establish norm estimates, we find the norm for some cases, we decide the triviality of the kernel of
Aahan Agrawal +4 more
semanticscholar +1 more source