Results 51 to 60 of about 1,134,156 (95)
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
Connected generalised Sierpiński carpets [PDF]
, 2010 Generalised Sierpiński carpets are planar sets that generalise the well-known Sierpiński carpet and are defined by means of sequences of patterns. We present necessary and sufficient conditions, under which generalised Sierpiński carpets are connected ...
Cristea, Ligia Loreta +3 more
core +1 more source
Topological indices for the iterations of Sierpiński rhombus and Koch snowflake
, 2021 In fractal geometry, the study of Sierpiński rhombus and Koch snowflake is one of the important and interesting research topics. Sierpiński rhombus is a planar fractal which is created using a related sequence of graphs named $$\{\mathrm{SR}_n\}_{n\ge 0}$
A. Divya, A. Manimaran
core +1 more source
Constructing disjoint Steiner trees in Sierpiński graphs
International audienceLet be a graph and with . Then the trees in are \emph{internally disjoint Steiner trees} connecting (or -Steiner trees) if and for every pair of distinct integers , .
Klasing, Ralf +4 more
core +1 more source
On the classification and toughness of generalized permutation star-graphs [PDF]
, 1997 summary:We use an algebraic method to classify the generalized permutation star-graphs, and we use the classification to determine the toughness of all generalized permutation star ...
Han, Shao-cen +2 more
core +1 more source
Cospectral Graphs and the Generalized Adjacency Matrix [PDF]
AMS classifications: 05C50; 05E99;cospectral graphs;generalized spectrum;generalized adjacency ...
Koolen, J.H. +2 more
core +2 more sources
Optimizing the human learnability of abstract network representations. [PDF]
Proc Natl Acad Sci U S A, 2022 Qian W +5 more
europepmc +1 more source
The Sierpiński domination number [PDF]
Let $G$ and $H$ be graphs and let $f colon V(G)rightarrow V(H)$ be a function. The Sierpiński product of $G$ and $H$ with respect to $f$, denoted by $G otimes _f H$, is defined as the graph on the vertex set $V(G)times V(H)$, consisting of $|V(G ...
Kleszcz, Elżbieta +3 more
core +1 more source
Developments on Spectral Characterizations of Graphs [PDF]
In [E.R. van Dam and W.H. Haemers, Which graphs are determined by their spectrum?, Linear Algebra Appl. 373 (2003), 241-272] we gave a survey of answers to the question of which graphs are determined by the spectrum of some matrix associated to the graph.
Dam, E.R. van, Haemers, W.H.
core
Propagating Sets in Sierpiński Fractal Graphs
A set S of black colored vertices in a graph G is called a zero forcing set of G if at every discrete time step, a black vertex with exactly one non-black vertex as its neighbour forces it to be colored black and by iteratively applying the procedure ...
Hossein Rashmanlou +2 more
core +1 more source