Results 21 to 30 of about 167 (109)
Security number of Sierpiński graphs
, 2023 V nalogi je najprej predstavljena terminologija in teoretične osnove potrebne za razumevanje pojmov varnosti, dominacije in varnostne dominacije v grafih. V drugem delu diplomskega dela, bomo definirali grafe Sierpińskega.
Čelan, Nika
core
Open Mathematics, 2016 As a generalization of the Sierpiński-like graphs, the subdivided-line graph Г(G) of a simple connected graph G is defined to be the line graph of the barycentric subdivision of G.
Shang Yilun
doaj +1 more source
Injective colorings of Sierpiński-like graphs and Kneser graphs
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 +4 more
core +3 more sources
InfoScience, EarlyView.Designing new polymers for applications such as sustainable plastics, biomaterials, and 3D printing has traditionally been slow and expensive, relying heavily on trial‐and‐error experiments. This review shows how polymer informatics—the integration of large polymer databases, machine‐learning models, and automated robotic synthesis—enables fast ...
Md. Saiful Islam +6 more
wiley +1 more source
Topological indices for the iterations of Sierpiński rhombus and Koch snowflake
, 2021 In fractal geometry, the study of Sierpiński rhombus and Koch snowflake is one of the important and interesting research topics. Sierpiński rhombus is a planar fractal which is created using a related sequence of graphs named $$\{\mathrm{SR}_n\}_{n\ge 0}$
A. Divya, A. Manimaran
core +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
Mathematical Methods in the Applied Sciences, EarlyView.ABSTRACT We develop a unified mathematical framework extending classical moment theory from discrete integer orders to a continuous spectrum of real orders f>0$$ f>0 $$, providing a systematic statistical characterization of complex systems exhibiting power‐law behavior.
Farrukh A. Chishtie
wiley +1 more source
Monadic second-order logic and the domino problem on self-similar graphs [PDF]
, 2022 We consider the domino problem on Schreier graphs of self-similar groups, and more generally their monadic second-order logic. On the one hand, we prove that if the group is bounded, then the domino problem on the graph is decidable; furthermore, under ...
Bartholdi, Laurent
core +1 more source
Kuramoto Model on Sierpinski Gasket I: Harmonic Maps
Studies in Applied Mathematics, Volume 156, Issue 5, May 2026.ABSTRACT Motivated by the study of attractors in the Kuramoto model (KM) on graphs, approximating the Sierpinski gasket (SG), we revisit the problem of harmonic maps (HMs) from SG to the circle, first considered by Strichartz. We provide a geometric proof of Strichartz's theorem, which states that for a prescribed degree and suitable boundary ...
Georgi S. Medvedev, Matthew S. Mizuhara
wiley +1 more source
Circle packings, renormalizations, and subdivision rules
Proceedings of the London Mathematical Society, Volume 132, Issue 4, April 2026.Abstract In this paper, we use iterations of skinning maps on Teichmüller spaces to study circle packings and develop a renormalization theory for circle packings whose nerves satisfy certain subdivision rules. We characterize when the skinning map has bounded image.
Yusheng Luo, Yongquan Zhang
wiley +1 more source