Results 11 to 20 of about 167 (109)
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
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
Modelling complex networks by random hierarchical graphs
Condensed Matter Physics, 2008 Numerous complex networks contain special patterns, called network motifs. These are specific subgraphs, which occur oftener than in randomized networks of Erdős-Rényi type.
M.Wróbel
doaj +2 more sources
The Sierpiński product of graphs
, 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
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
Resolvability and convexity properties in the Sierpiński product of graphs
, 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
Strong Geodetic Problem in Networks
Discussiones Mathematicae Graph Theory, 2020 In order to model certain social network problems, the strong geodetic problem and its related invariant, the strong geodetic number, are introduced.
Manuel Paul +4 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
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 +1 more source