Results 61 to 70 of about 167 (109)
Enumeration problems for classes of self-similar graphs
, 2007 We describe a general construction principle for a class of self-similar graphs. For various enumeration problems, we show that this construction leads to polynomial systems of recurrences and provide methods to solve these recurrences asymptotically ...
Teufl, Elmar, Wagner, Stephan
core +1 more source
Exact and asymptotic enumeration of perfect matchings in self-similar graphs
, 2009 We consider self-similar graphs following a specific construction scheme: in each step, several copies of the level-n graph Xn are amalgamated to form Xn+1. Examples include finite Sierpiński graphs or Viček graphs.
Teufl, Elmar, Wagner, Stephan
core +1 more source
A 2-parametric generalization of Sierpiński gasket graphs
, 2015 Graphs ▫$S[n,k]$▫ are introduced as the graphs obtained from the Sierpiński graphs ▫$S(n,k)$▫ by contracting edges that lie in no triangle. The family ▫$S[n,k]$▫ is a previously studied class of Sierpiñski gasket graphs ▫$S_n$▫.
Jakovac, Marko
core
(d, n)-packing coloring of generalized Sierpiński graphs
, 2019 V magistrski nalogi so opisani grafi Sierpińskega in njihove posplošitve, (d, n)-pakirno barvanje grafov ter računsko iskanje (d, n)-pakirnih kromatičnih števil. Razvili smo algoritem za generiranje grafov Sierpińskega z osnovo 4 ter implementirali štiri
Jeromel, Anže
core
The Number of Spanning Trees in Self-Similar Graphs
, 2011 The number of spanning trees of a graph, also known as the complexity, is computed for graphs constructed by a replacement procedure yielding a self-similar structure.
Stephan Wagner +3 more
core +1 more source
The sigma chromatic number of the Sierpinski gasket graphs and the Hanoi graphs
, 2020 A vertex coloring c : V(G) → of a non-trivial connected graph G is called a sigma coloring if σ(u) ≠ σ(v) for any pair of adjacent vertices u and v. Here, σ(x) denotes the sum of the colors assigned to vertices adjacent to x.
Garciano, Agnes +3 more
core
Enumeration of matchings in families of self-similar graphs
, 2010 The number of matchings of a graph G is an important graph parameter in various contexts, notably in statistical physics (dimer–monomer model). Following recent research on graph parameters of this type in connection with self-similar, fractal-like ...
Stephan Wagner +3 more
core +1 more source
Programming and simulating chemical reaction networks on a surface. [PDF]
J R Soc Interface, 2020 Clamons S, Qian L, Winfree E.
europepmc +1 more source
SierpińSki Gasket Graphs and Some of Their Properties
, 2006 The Sierpiński fractal or Sierpiński gasket ∈ is a familiar object studied by specialists in dynamical systems and probability. In this paper, we consider a graph Sn derived from the first n iterations of the process that leads to ∈, and study some of ...
Teguia, Alberto, Godbole, Anant P.
core
Connectivity and some other properties of generalized Sierpiński graphs
, 2018 If G is a graph and n a positive integer, then the generalized Sierpi?ski graph SnG is a fractal-like graph that uses G as a building block. The construction of SnG generalizes the classical Sierpi?ski graphs Sn p, where the role of G is played ...
Sara Zemljic, Sandi Klavzar
core +1 more source