Results 11 to 20 of about 413,829 (102)
On Generalized Sierpiński Graphs [PDF]
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
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 +2 more sources
Entropies and Degree-Based Topological Indices of Generalized Sierpiński Graphs
Fractal and FractionalFractals are geometric patterns that appear self-similar across all length scales and are constructed by repeating a single unit on a regular basis. Entropy, as a core thermodynamic function, is an extension based on information theory (such as Shannon ...
Si-Ao Xu, Jia-Dong Si, Jia-Bao Liu
doaj +2 more sources
The Sierpiński product of graphs [PDF]
, 2023 In this paper we introduce a product-like operation that generalizes the construction of the generalized Sierpiński graphs. Let ▫$G, , H$▫ be graphs and let ▫$f: V(G) to V(H)$▫ be a function.
Žitnik, Arjana +3 more
core +1 more source
Resolvability and convexity properties in the Sierpiński product of graphs [PDF]
, 2023 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 ...
González Yero, Ismael +5 more
core +1 more source
Injective colorings of Sierpiński-like graphs and Kneser graphs [PDF]
Two relationships between the injective chromatic number and, respectively, chromatic number and chromatic index, are proved. They are applied to determine the injective chromatic number of Sierpiński graphs and to give a short proof that Sierpiński ...
Samadi, Babak +3 more
core +4 more sources
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
Discussiones Mathematicae Graph Theory, 2020 Metric properties of Hanoi graphs Hnp are not as well understood as those of the closely related, but structurally simpler Sierpiński graphs Snp. The most outstanding open problem is to find the domination number of Hanoi graphs.
Hinz Andreas M., Movarraei Nazanin
doaj +1 more source
Vertex-, edge-, and total-colorings of Sierpiński-like graphs [PDF]
, 2009 Vertex-colorings, edge-colorings and total-colorings of the Sierpiński gasket graphs Sn, the Sierpiński graphs S(n,k), graphs S+(n,k), and graphs S++(n,k) are considered. In particular, χ″(Sn), χ′(S(n,k)), χ(S+(n,k)), χ(S++(n,k)), χ′(S+(n,k)), and χ′(S++(
Jakovac, Marko, Klavžar, Sandi
core +1 more source
Degree sequence of the generalized Sierpiński graph [PDF]
, 2020 Sierpiński graphs are studied in fractal theory and have applications in diverse areas including dynamic systems, chemistry, psychology, probability, and computer science.
Attarzadeh, Fatemeh +2 more
core +1 more source