Results 21 to 30 of about 280,214 (233)

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

Distinguishing homomorphisms of infinite graphs [PDF]

, 2012
We supply an upper bound on the distinguishing chromatic number of certain infinite graphs satisfying an adjacency property. Distinguishing proper $n$-colourings are generalized to the new notion of distinguishing homomorphisms. We prove that if a graph $
Bonato, Anthony, Delic, Dejan
core   +3 more sources

Characterising memory in infinite games [PDF]

Logical Methods in Computer Science
This 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

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

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

Note on robust coloring of planar graphs [PDF]

Opuscula 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š, Borut Lužar, Roman Soták   +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

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, Johannson, Juan Alonso, Scott, Stallings, Zieschang   +5 more
core   +1 more source

Flip-graph moduli spaces of filling surfaces [PDF]

, 2014
This paper is about the geometry of flip-graphs associated to triangulations of surfaces. More precisely, we consider a topological surface with a privileged boundary curve and study the spaces of its triangulations with n vertices on the boundary curve.
Parlier, Hugo, Pournin, Lionel
core   +1 more source

Classes of graphs with restricted interval models [PDF]

Discrete 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