Results 21 to 30 of about 24,440 (246)
Sobolev Regularity of Multilinear Fractional Maximal Operators on Infinite Connected Graphs
Mathematics, 2021 Let G be an infinite connected graph. We introduce two kinds of multilinear fractional maximal operators on G. By assuming that the graph G satisfies certain geometric conditions, we establish the bounds for the above operators on the endpoint Sobolev ...
Suying Liu, Feng Liu
doaj +1 more source
Generating Infinite Random Graphs [PDF]
Proceedings of the Edinburgh Mathematical Society, 2018 AbstractWe define a growing model of random graphs. Given a sequence of non-negative integers {dn}n=0∞ with the property that di≤i, we construct a random graph on countably infinitely many vertices v0, v1… by the following process: vertex vi is connected to a subset of {v0, …, vi−1} of cardinality di chosen uniformly at random.
Biró, Csaba, Darji, Udayan B.
openaire +2 more sources
Isospectral reduction in infinite graphs [PDF]
Journal of Spectral Theory, 2020 L. A. Bunimovich and B. Z. Webb developed a theory for transforming a finite weighted graph while preserving its spectrum, referred as isospectral reduction theory. In this workwe extend this theory to a class of operators on Banach spaces that include Markov type operators.
Duarte, Pedro, Torres, M. J.
openaire +3 more sources
The Dynamics of the Forest Graph Operator
Discussiones Mathematicae Graph Theory, 2016 In 1966, Cummins introduced the “tree graph”: the tree graph T(G) of a graph G (possibly infinite) has all its spanning trees as vertices, and distinct such trees correspond to adjacent vertices if they differ in just one edge, i.e., two spanning trees ...
Dara Suresh +4 more
doaj +1 more source
Graphs whose vertex set can be partitioned into a total dominating set and an independent dominating set [PDF]
Opuscula MathematicaA graph \(G\) whose vertex set can be partitioned into a total dominating set and an independent dominating set is called a TI-graph. We give constructions that yield infinite families of graphs that are TI-graphs, as well as constructions that yield ...
Teresa W. Haynes, Michael A. Henning
doaj +1 more source
Alexandria Engineering Journal, 2022 Graph theory is a powerful and essential tool for applied scientists and engineers in analyzing and designing algorithms for several problems. Graph theory has a vital role in complex systems, especially in computer sciences. Applications of graph theory
A. El-Mesady +2 more
doaj +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
Context-Sensitive Languages, Rational Graphs and Determinism [PDF]
Logical Methods in Computer Science, 2006 We investigate families of infinite automata for context-sensitive languages. An infinite automaton is an infinite labeled graph with two sets of initial and final vertices.
Arnaud Carayol, Antoine Meyer
doaj +1 more source
A Framework for Rewriting Families of String Diagrams [PDF]
Electronic Proceedings in Theoretical Computer Science, 2019 We describe a mathematical framework for equational reasoning about infinite families of string diagrams which is amenable to computer automation. The framework is based on context-free families of string diagrams which we represent using context-free ...
Vladimir Zamdzhiev
doaj +1 more source
Unicorn paths and hyperfiniteness for the mapping class group
Forum of Mathematics, Sigma, 2021 Let S be an orientable surface of finite type. Using Pho-on’s infinite unicorn paths, we prove the hyperfiniteness of orbit equivalence relations induced by the actions of the mapping class group of S on the Gromov boundaries of the arc graph and the ...
Piotr Przytycki, Marcin Sabok
doaj +1 more source