Results 61 to 70 of about 1,555,658 (364)
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 +6 more sources
>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
Investigation of continuous-time quantum walk by using Krylov subspace-Lanczos algorithm [PDF]
, 2006 In papers\cite{js,jsa}, the amplitudes of continuous-time quantum walk on graphs possessing quantum decomposition (QD graphs) have been calculated by a new method based on spectral distribution associated to their adjacency matrix. Here in this paper, it
Aharonov +32 more
core +2 more sources
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
Classes of graphs with restricted interval models [PDF]
Discrete Mathematics & Theoretical Computer Science, 1999 We introduce q-proper interval graphs as interval graphs with interval models in which no interval is properly contained in more than q other intervals, and also provide a forbidden induced subgraph characterization of this class of graphs.
Andrzej Proskurowski, Jan Arne Telle
doaj +2 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
Journal of Combinatorial Theory, 1970 AbstractA theorem is established that provides necessary and sufficient conditions in order that a locally finite bipartite graph have a subgraph whose valences lie in prescribed intervals. This theorem is applied to the study of flows in locally finite directed graphs.
Jon Folkman, D.R. Fulkerson
openaire +2 more sources
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
Discussiones Mathematicae Graph Theory, 2013 The infimum of the least eigenvalues of all finite induced subgraphs of an infinite graph is defined to be its least eigenvalue. In [P.J. Cameron, J.M. Goethals, J.J. Seidel and E.E. Shult, Line graphs, root systems, and elliptic geometry, J. Algebra 43 (
Vijayakumar Gurusamy Rengasamy
doaj +1 more source
On the spectrum of an infinite graph
Linear Algebra and its Applications, 1987 We exhibit an example of an infinite locally finite graph such that its adjacency operator is not self-adjoint. This gives a negative answer to a conjecture of \textit{B. Mohar} [Linear Algebra Appl. 48, 245-256 (1982; Zbl 0502.05040)].
openaire +3 more sources