Results 1 to 10 of about 78 (70)
Topological Properties of Polymeric Networks Modelled by Generalized Sierpiński Graphs
Fractal and FractionalIn this article, we compute the irregularity measures of generalized Sierpiński graphs and obtain some bounds on these irregularities. Moreover, we discuss some bounds on connectivity indices for generalized Sierpiński graphs of any arbitrary graph H ...
Alaa Altassan, Muhammad Imran
doaj +4 more sources
On Generalized Sierpiński Graphs
Discussiones Mathematicae Graph Theory, 2017 In this paper we obtain closed formulae for several parameters of generalized Sierpiński graphs S(G, t) in terms of parameters of the base graph G. In particular, we focus on the chromatic, vertex cover, clique and domination numbers.
Rodríguez-Velázquez Juan Alberto +2 more
doaj +3 more sources
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
Extrema property of the k-ranking of directed paths and cycles
AKCE International Journal of Graphs and Combinatorics, 2016 A k-ranking of a directed graph G is a labeling of the vertex set of G with k positive integers such that every directed path connecting two vertices with the same label includes a vertex with a larger label in between.
Breeanne Baker Swart +3 more
doaj +2 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
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
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
Exact double domination in the generalized Sierpiński graphs [PDF]
AUT Journal of Mathematics and ComputingA subset $D$ of vertices of a simple graph $G$ is an exact double dominating set if each vertex $v$ of $G$ is dominated by exactly two vertices of $D$, i.e. $|N_G[v]\cap D|=2$, in which $N_G[v]$ is the closed neighborhood of $v$ in $G$
Mahsa Khatibi, Ali Behtoei
doaj +1 more source
Domination parameters of generalized Sierpiński graphs
AKCE International Journal of Graphs and CombinatoricsIn this paper, we obtain the Italian domination number, perfect Italian domination number and double Roman domination number of generalized Sierpiński graph [Formula: see text] where G is a cycle Cn, [Formula: see text] a complete bipartite graph ...
Jismy Varghese +2 more
doaj +1 more source