Results 71 to 80 of about 167 (109)
Mutual-visibility and general position sets in Sierpiński triangle graphs
For a given graph \(G\), the general position problem asks for the largest set of vertices \(M \subseteq V(G)\) such that no three distinct vertices of \(M\) belong to a common shortest path in \(G\).
Vesel, Aleksander, Korže, Danilo
core +3 more sources
Coloring Sierpiński graphs and Sierpiński gasket graphs
, 2008 Sierpinski graphs S(n, 3) are the graphs of the Tower of Hanoi with n disks, while Sierpinski gasket graphs Sn are the graphs naturally defined by the finite number of iterations that lead to the Sierpinski gasket.
Sandi Klavžar
core
Distances and automatic sequences in distinguished variants of Hanoi graphs [PDF]
, 2016 In this thesis three open problems concerning Hanoi-type graphs are addressed. I prove a theorem to determine all shortest paths between two arbitrary vertices s and t in the General Sierpiński graph S_p^n with base p ≥ 3 and exponent n ≥ 0 and find an ...
Holz auf der Heide, Caroline
core
On the roman domination number of generalized Sierpiński graphs
, 2017 A map f : V?(0,1,2) is a Roman dominating function on a graph G = (V,E) if for every vertex v ? V with f(v)=0, there exists a vertex u, adjacent to v, such that f(u)=2. The weight of a Roman dominating function is given by f(V)=?u?V f(u).
E.D. Rodríguez-Bazan +2 more
core +1 more source
ON EV-DEGREE and VE-DEGREE BASED TOPOLOGICAL PROPERTIES of the SIERPIŃSKI GASKET FRACTAL
, 2019 In chemistry, pharmacology, medicine and physics molecular graphs have been used to model molecular substances, networks and fractals. Topological indices have been derived from the molecular graphs of chemical compounds, networks and fractals ...
Yamaç, Kerem, Cancan, Murat
core
Regularized Laplacian determinants of self-similar fractals. [PDF]
Lett Math Phys, 2018 Chen JP, Teplyaev A, Tsougkas K.
europepmc +1 more source
Sierpiński graphs as spanning subgraphs of Hanoi graphs
Open Mathematics, 2013 Hinz Andreas +2 more
doaj +1 more source
A new method to measure complexity in binary or weighted networks and applications to functional connectivity in the human brain. [PDF]
BMC Bioinformatics, 2016 Hahn K, Massopust PR, Prigarin S.
europepmc +1 more source
The Median of Sierpinski Triangle Graphs
The median $M$ of a graph $G$ is the set of vertices with a minimum total distance to all other vertices in the graph. In this paper, we determine the median of Sierpiński triangle graphs.
Balakrishnan, Kannan +5 more
core
Metrične lastnosti grafov Sierpińskega
, 2017 In this thesis we study the metric properties of Sierpiński graphs. Sierpiński graphs form a two-parametric family of graphs similar to Hanoi graphs that originate in the Tower of Hanoi puzzle.
Zemljič, Sara Sabrina
core