Results 11 to 20 of about 709,702 (295)
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 +9 more sources
Infinite friendship graphs with infinite parameters [PDF]
Journal of Combinatorial Theory, Series B, 1991 We study infinite graphs in which every set of \(\kappa\) vertices has exactly \(\lambda\) common neighbours. We prove that there exist \(2^{\sigma}\) such graphs of each infinite order \(\sigma\) if \(\kappa\) is finite and that for \(\kappa\) infinite there are \(2^{\lambda}\) of them of order \(\lambda\) and none of cardinality greater than ...
Gena Hahn +2 more
openaire +4 more sources
Journal of Combinatorial Theory, Series B, 1994 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Frank Niedermeyer, Klaus-Peter Podewski
openaire +2 more sources
Discrete Mathematics, 1975 AbstractSome relations between the number of nodes and edges and the degrees of the nodes in infinite graphs are obtained. The structure of infinite connected graphs which have no- ∞ trails is investigated with the help of these. It is shown, for example, that any such graph G has |G| nodes of odd degree.
Dirac, G.A.
openaire +4 more sources
On the Metric Dimension of Infinite Graphs [PDF]
Electronic Notes in Discrete Mathematics, 2009 A set of vertices $S$ \emph{resolves} a graph $G$ if every vertex is uniquely determined by its vector of distances to the vertices in $S$. The \emph{metric dimension} of a graph $G$ is the minimum cardinality of a resolving set. In this paper we study the metric dimension of infinite graphs such that all its vertices have finite degree.
José Cáceres +4 more
openaire +7 more sources
Embeddings of infinite graphs [PDF]
Journal of Combinatorial Theory, Series B, 1988 Embeddings of infinite graphs in surfaces (not necessarily compact) without boundary are considered. Cellular embeddings are studied in details. Each rotation system of a locally finite graph G gives rise to a cellular embedding of G into some surface, and every cellular embedding with all 2-cells of finite size can be obtained in this way.
Mohar, Bojan
openaire +3 more sources
Infinite graphs—A survey [PDF]
Journal of Combinatorial Theory, 1967 AbstractThis expository article describes work which has been done on various problems involving infinite graphs, mentioning also a few unsolved problems or suggestions for future investigation.
Nash-Williams, C.St.J.A.
openaire +3 more sources
Infinite matroids in graphs [PDF]
Discrete Mathematics, 2011 It has recently been shown that infinite matroids can be axiomatized in a way that is very similar to finite matroids and permits duality. This was previously thought impossible, since finitary infinite matroids must have non-finitary duals. In this paper we illustrate the new theory by exhibiting its implications for the cycle and bond matroids of ...
Henning Bruhn, Reinhard Diestel
openaire +4 more sources
Infinite triangulated graphs [PDF]
Discrete Mathematics, 1978 AbstractWe strengthen a theorem of W.T. Trotter relating α-imperfect graphs to Suslin trees and derive several new results for infinite graphs with no chordless 4-cycles. We show that for such graphs G, (1) if G is χ-perfect then G is α-perfect, and (2) ΘG is at most the first cardinal beyond αG. We also indicate how Martin's axiom can be used to prove
Wagon, Stanley
openaire +3 more sources
Reconstruction of infinite graphs [PDF]
Discrete Mathematics, 1991 The paper surveys results concerning reconstruction and edge- reconstructon of infinite graphs and draws attention to several interesting unsolved problems.
Nash-Williams, C.St.J.A. +1 more
openaire +3 more sources