Results 1 to 10 of about 167 (109)
On some bounds of the topological indices of generalized Sierpiński and extended Sierpiński graphs
Journal of Inequalities and Applications, 2019 Sierpiński graphs are extensively studied graphs of fractal nature with applications in topology, mathematics of Tower of Hanoi and computer science. The generalized Sierpiński graphs are defined by replication of exactly the same graph, yielding self ...
Imran Javaid +4 more
doaj +2 more sources
Spanning trees of finite Sierpiński graphs [PDF]
Discrete Mathematics & Theoretical Computer Science, 2006 We show that the number of spanning trees in the finite Sierpiński graph of level $n$ is given by $\sqrt[4]{\frac{3}{20}} (\frac{5}{3})^{-n/2} (\sqrt[4]{540})^{3^n}$.
Elmar Teufl, Stephan Wagner
doaj +2 more sources
TOTAL EDGE IRREGULAR LABELING FOR TRIANGULAR GRID GRAPHS AND RELATED GRAPHS
Barekeng, 2023 Let be a graph with and are the set of its vertices and edges, respectively. Total edge irregular -labeling on is a map from to satisfies for any two distinct edges have distinct weights. The minimum for which the satisfies the labeling is spoken
Muhammad Nurul Huda, Yeni Susanti
doaj +3 more sources
Some topological properties of uniform subdivision of Sierpiński graphs
Main Group Metal Chemistry, 2021 Sierpiński graphs are family of fractal nature graphs having applications in mathematics of Tower of Hanoi, topology, computer science, and many more diverse areas of science and technology. This family of graphs can be generated by taking certain number
Liu Jia-Bao +3 more
doaj +1 more source
Packing coloring of generalized Sierpinski graphs [PDF]
Discrete Mathematics & Theoretical Computer Science, 2019 The packing chromatic number $\chi_{\rho}(G)$ of a graph $G$ is the smallest integer $c$ such that the vertex set $V(G)$ can be partitioned into sets $X_1, . . .
Danilo Korze, Aleksander Vesel
doaj +1 more source
Covering codes in Sierpinski graphs [PDF]
Discrete Mathematics & Theoretical Computer Science, 2010 Graphs and ...
Laurent Beaudou +4 more
doaj +1 more source
Entropy and Multi-Fractal Analysis in Complex Fractal Systems Using Graph Theory
Axioms, 2023 In 1997, Sierpinski graphs, S(n,k), were obtained by Klavzar and Milutinovic. The graph S(1,k) represents the complete graph Kk and S(n,3) is known as the graph of the Tower of Hanoi. Through generalizing the notion of a Sierpinski graph, a graph named a
Zeeshan Saleem Mufti +3 more
doaj +1 more source
Journal of Algorithms & Computational Technology, 2021 The normalized Laplacian spectrum of a graph is an important tool that one can use to find much information about its topological and structural characteristics and also on some relevant dynamical aspects, specifically in relation to random walks.
Zhiyong Zhu
doaj +1 more source
Discovering Irregularities from Computer Networks by Topological Mapping
Applied Sciences, 2022 Any number that can be uniquely identified and varied by a graph is known as a graph invariant. This paper will talk about three unique variations of bridge networks, sierpinski networks, honeycomb, and hexagonal networks, with great capability of ...
Khalid Hamid +5 more
doaj +1 more source
On the zero forcing number of generalized Sierpinski graphs [PDF]
Transactions on Combinatorics, 2019 In this article we study the Zero forcing number of Generalized Sierpi\'{n}ski graphs $S(G,t)$. More precisely, we obtain a general lower bound on the Zero forcing number of $S(G,t)$ and we show that this bound is tight.
Ebrahim Vatandoost +2 more
doaj +1 more source