Results 31 to 40 of about 1,327,272 (305)

On Transmission Irregular Cubic Graphs of an Arbitrary Order

open access: yesMathematics, 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

Geometric properties of infinite graphs and the Hardy–Littlewood maximal operator [PDF]

open access: yesJournal d'Analyse Mathematique, 2016
We study different geometric properties on infinite graphs, related to the weak-type boundedness of the Hardy–Littlewood maximal averaging operator. In particular, we analyze the connections between the doubling condition, having finite dilation and ...
Javier Soria, P. Tradacete
semanticscholar   +1 more source

An introduction of F-graphs, a graph-theoretic representation of natural numbers

open access: yesInternational 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

A random Schrödinger operator associated with the Vertex Reinforced Jump Process on infinite graphs [PDF]

open access: yesJournal 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]

open access: yesInternational 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

Isospectral infinite graphs and networks and infinite eigenvalue multiplicities

open access: yesNetworks and Heterogeneous Media, 2009
We considerthe continuous Laplacian on infinite locally finite networks undernatural transition conditions as continuity at the ramificationnodes and Kirchhoff flow conditions at all vertices.
Joachim von Below, José A. Lubary
doaj   +1 more source

Note on robust coloring of planar graphs [PDF]

open access: yesOpuscula Mathematica
We consider the robust chromatic number \(\chi_1(G)\) of planar graphs \(G\) and show that there exists an infinite family of planar graphs \(G\) with \(\chi_1(G) = 3\), thus solving a recent problem of Bacsó et al.
František Kardoš   +2 more
doaj   +1 more source

On P-transitive graphs and applications [PDF]

open access: yesElectronic Proceedings in Theoretical Computer Science, 2011
We introduce a new class of graphs which we call P-transitive graphs, lying between transitive and 3-transitive graphs. First we show that the analogue of de Jongh-Sambin Theorem is false for wellfounded P-transitive graphs; then we show that the mu ...
Giacomo Lenzi
doaj   +1 more source

(β)‐distortion of some infinite graphs [PDF]

open access: yesJournal of the London Mathematical Society, 2015
A distortion lower bound of Ω(log(h)1/p) is proved for embedding the complete countably branching hyperbolic tree of height h into a Banach space admitting an equivalent norm satisfying property (β) of Rolewicz with modulus of power type p∈(1,∞) (in ...
F. Baudier, Shenmin Zhang
semanticscholar   +1 more source

Classes of graphs with restricted interval models [PDF]

open access: yesDiscrete 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

Home - About - Disclaimer - Privacy