Results 31 to 40 of about 732,643 (255)
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
On infinite outerplanar graphs [PDF]
, 1990 summary:In this Note, we study infinite graphs with locally finite outerplane embeddings, given a characterization by forbidden ...
Boza, L. +6 more
core +1 more source
Some spectral comparison results on infinite quantum graphs [PDF]
, 2023 In this paper we establish spectral comparison results for Schrödinger operators on a certain class of infinite quantum graphs, using recent results obtained in the finite setting.
Bifulco, Patrizio, Kerner, Joachim
core +1 more source
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
On external presentations of infinite graphs [PDF]
Electronic Proceedings in Theoretical Computer Science, 2009 The vertices of a finite state system are usually a subset of the natural numbers. Most algorithms relative to these systems only use this fact to select vertices.
Christophe Morvan
doaj +1 more source
Arithmetically maximal independent sets in infinite graphs [PDF]
, 2005 Families of all sets of independent vertices in graphs are investigated. The problem how to characterize those infinite graphs which have arithmetically maximal independent sets is posed.
Bylka, Stanisław
core +1 more source
Linearly bounded infinite graphs [PDF]
, 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.
Meyer, Antoine +3 more
core +1 more source
On infinite outerplanar graphs [PDF]
, 1994 In this Note, we study infinite graphs with locally finite outerplane embeddings, given a characterization by forbidden ...
Márquez Pérez, Alberto +2 more
core +1 more source
Note on robust coloring of planar graphs [PDF]
Opuscula MathematicaWe 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]
Electronic 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