Results 11 to 20 of about 280,214 (233)
On cyclic orthogonal double covers of circulant graphs by special infinite graphs
AKCE International Journal of Graphs and Combinatorics, 2017 In this article, a technique to construct cyclic orthogonal double covers (CODCs) of regular circulant graphs by certain infinite graph classes such as complete bipartite and tripartite graphs and disjoint union of butterfly and is introduced.
R. El-Shanawany, A. El-Mesady
doaj +2 more sources
A new class of graceful graphs: k-enriched fan graphs and their characterisations
Cubo, 2021 The Graceful Tree Conjecture stated by Rosa in the mid 1960s says that every tree can be gracefully labelled. It is one of the best known open problems in Graph Theory.
M. Haviar, S. Kurtulík
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
Matchings on infinite graphs [PDF]
, 2011 Elek and Lippner (2010) showed that the convergence of a sequence of bounded-degree graphs implies the existence of a limit for the proportion of vertices covered by a maximum matching.
C Bordenave +14 more
core +5 more sources
Seidel Integral Complete Split Graphs [PDF]
Mathematics Interdisciplinary Research, 2019 In the paper we consider a generalized join operation, that is, the H-join on graphs where H is an arbitrary graph. In terms of Seidel matrix of graphs we determine the Seidel spectrum of the graphs obtained by this operation on regular graphs.
Pavel Hic +2 more
doaj +1 more source
Cycle density in infinite Ramanujan graphs [PDF]
, 2015 We introduce a technique using nonbacktracking random walk for estimating the spectral radius of simple random walk. This technique relates the density of nontrivial cycles in simple random walk to that in nonbacktracking random walk.
Lyons, Russell, Peres, Yuval
core +1 more source
Infinite families of asymmetric graphs
AKCE International Journal of Graphs and Combinatorics, 2020 A graph G is asymmetric if its automorphism group of vertices is trivial. Asymmetric graphs were introduced by Erdős and Rényi in 1963. They showed that the probability of a graph on n vertices being asymmetric tends to 1 as n tends to infinity.
Alejandra Brewer +5 more
doaj +1 more source
A trace on fractal graphs and the Ihara zeta function [PDF]
, 2008 Starting with Ihara's work in 1968, there has been a growing interest in the study of zeta functions of finite graphs, by Sunada, Hashimoto, Bass, Stark and Terras, Mizuno and Sato, to name just a few authors.
Guido, Daniele +2 more
core +2 more sources
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
Schreier graphs of the Basilica group [PDF]
, 2010 With any self-similar action of a finitely generated group $G$ of automorphisms of a regular rooted tree $T$ can be naturally associated an infinite sequence of finite graphs $\{\Gamma_n\}_{n\geq 1}$, where $\Gamma_n$ is the Schreier graph of the action ...
D'Angeli, Daniele +3 more
core +6 more sources