Results 331 to 340 of about 1,555,658 (364)
The Spectrum of an Infinite Graph [PDF]
Canadian Journal of Mathematics, 2000 AbstractIn this paper, we consider the (essential) spectrum of the discrete Laplacian of an infinite graph. We introduce a new quantity for an infinite graph, in terms of which we give new lower bound estimates of the (essential) spectrum and give also upper bound estimates when the infinite graph is bipartite. We give sharp estimates of the (essential)
openaire +1 more source
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Doklady Mathematics, 2017
Infinite quantum graphs with δ-interactions at vertices are studied without any assumptions on the lengths of edges of the underlying metric graphs. A connection between spectral properties of a quantum graph and a certain discrete Laplacian given on a graph with infinitely many vertices and edges is established.
Pavel Exner +4 more
openaire +4 more sources
Infinite quantum graphs with δ-interactions at vertices are studied without any assumptions on the lengths of edges of the underlying metric graphs. A connection between spectral properties of a quantum graph and a certain discrete Laplacian given on a graph with infinitely many vertices and edges is established.
Pavel Exner +4 more
openaire +4 more sources
A copositive formulation for the stability number of infinite graphs
Mathematical programming, 2013In the last decade, copositive formulations have been proposed for a variety of combinatorial optimization problems, for example the stability number (independence number).
Cristian Dobre +3 more
semanticscholar +1 more source
The Rigidity of Infinite Graphs II
Graphs Comb., 2022D. Kitson, S. Power
semanticscholar +1 more source
Infinite Sets and Infinite Graphs [PDF]
, 1985 E.C. MILNER: Let me begin with a problem due to Prikry and myself. First I’ll state a theorem concerning the depth of an ordered set. The depth of a partial order is the least ordinal γ such that does not embed γ*, the reverse of γ. For example vK has depth v+, if v ⪰ ω, κ ⪰ 2.
openaire +1 more source
Infinite Combinatorics and Graphs
2000Infinite sets are very peculiar, and remarkably different from finite sets. This can be illustrated with a combinatorial example.
Michael J. Mossinghoff +2 more
openaire +2 more sources