Results 11 to 20 of about 25,369 (266)
Controlled information transfer in continuous-time chiral quantum walks
New Journal of Physics, 2021 In this paper we investigate properties of continuous time chiral quantum walks, which possess complex valued edge weights in the underlying graph structure, together with an initial Gaussian wavefunction spread over a number of vertices.
A Khalique, A Sett, J B Wang, J Twamley
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
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
Applying Infinite Petri Nets to the Cybersecurity of Intelligent Networks, Grids and Clouds
Applied Sciences, 2021 Correctness of networking protocols represents the principal requirement of cybersecurity. Correctness of protocols is established via the procedures of their verification. A classical communication system includes a pair of interacting systems.
Dmitry A. Zaitsev +2 more
doaj +1 more source
Journal of Combinatorial Theory, Series B, 1994 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Frank Niedermeyer, Klaus-Peter Podewski
openaire +1 more source
The Rigidity of Infinite Graphs II [PDF]
Graphs and Combinatorics, 2022 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Derek Kitson, Stephen C. Power
openaire +2 more sources
Cutsets in Infinite Graphs [PDF]
Combinatorics, Probability and Computing, 2006 We answer three questions posed in a paper by Babson and Benjamini. They introduced a parameter $C_G$ for Cayley graphs $G$ that has significant application to percolation. For a minimal cutset of $G$ and a partition of this cutset into two classes, take the minimal distance between the two classes.
openaire +2 more sources
Hamilton Connectivity of Convex Polytopes with Applications to Their Detour Index
Complexity, 2021 A connected graph is called Hamilton-connected if there exists a Hamiltonian path between any pair of its vertices. Determining whether a graph is Hamilton-connected is an NP-complete problem.
Sakander Hayat +3 more
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
Linearly bounded infinite graphs [PDF]
Acta Informatica, 2005 Linearly bounded Turing machines have been mainly studied as acceptors for context-sensitive languages. We define a natural class of infinite automata representing their observable computational behavior, called linearly bounded graphs. These automata naturally accept the same languages as the linearly bounded machines defining them. We present some of
Carayol, Arnaud, Meyer, Antoine
openaire +5 more sources