Results 41 to 50 of about 1,555,658 (364)
Positive solutions of $p$-th Yamabe type equations on infinite graphs [PDF]
Proceedings of the American Mathematical Society, 2017 Let G = (V,E) be a connected infinite and locally finite weighted graph, ∆p be the p-th discrete graph Laplacian. In this paper, we consider the p-th Yamabe type equation −∆pu+ h|u| u = gu on G, where h and g are known, 2 < α ≤ p.
Xiaoxiao Zhang, Aijin Lin
semanticscholar +1 more source
Families of nested completely regular codes and distance-regular graphs [PDF]
, 2014 In this paper infinite families of linear binary nested completely regular codes are constructed. They have covering radius $\rho$ equal to $3$ or $4$, and are $1/2^i$-th parts, for $i\in\{1,\ldots,u\}$ of binary (respectively, extended binary) Hamming ...
Borges, J., Rifà, J., Zinoviev, V. A.
core +5 more sources
A random Schrödinger operator associated with the Vertex Reinforced Jump Process on infinite graphs [PDF]
Journal of The American Mathematical Society, 2015 This paper concerns the vertex reinforced jump process (VRJP), the edge reinforced random walk (ERRW), and their relation to a random Schrödinger operator.
C. Sabot, Xiaolin Zeng
semanticscholar +1 more source
Arbitrary Pattern Formation on Infinite Regular Tessellation Graphs [PDF]
International Conference of Distributed Computing and Networking, 2020 Given a set R of robots, each one located at a different vertex of an infinite regular tessellation graph, we aim to explore the Arbitrary Pattern Formation (APF) problem.
Serafino Cicerone +3 more
semanticscholar +1 more source
Characterising memory in infinite games [PDF]
Logical Methods in Computer ScienceThis paper is concerned with games of infinite duration played over potentially infinite graphs. Recently, Ohlmann (LICS 2022) presented a characterisation of objectives admitting optimal positional strategies, by means of universal graphs: an objective ...
Antonio Casares, Pierre Ohlmann
doaj +1 more source
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.
Aacute, dám Timár
openaire +3 more sources
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
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
An introduction of F-graphs, a graph-theoretic representation of natural numbers
International Journal of Mathematics and Mathematical Sciences, 1992 A special type of family graphs (F-graphs, for brevity) are introduced. These are cactus-type graphs which form infinite families under an attachment operation. Some of the characterizing properties of F-graphs are discussed.
E. J. Farrell
doaj +1 more source
JSJ decompositions of Quadratic Baumslag-Solitar groups [PDF]
, 2011 Generalized Baumslag-Solitar groups are defined as fundamental groups of graphs of groups with infinite cyclic vertex and edge groups. Forester proved (in "On uniqueness of JSJ decompositions of finitely generated groups", Comment. Math. Helv.
Jaco +5 more
core +1 more source