Results 21 to 30 of about 1,134,156 (95)
We elaborate Alfred Schutz's theory of musical communication empirically. Our technique for analysing musical communication aligns Schutz's sociological theory with the mathematics of anticipatory systems. Music, we argue, can be considered as an anticipatory system that articulates through its diachronic unfolding, fundamental symmetries which can be ...
Mark William Johnson, Loet Leydesdorff
wiley +1 more source
Generalized connectivity of some total graphs [PDF]
summary:We study the generalized $k$-connectivity $\kappa _k(G)$ as introduced by Hager in 1985, as well as the more recently introduced generalized $k$-edge-connectivity $\lambda _k(G)$. We determine the exact value of $\kappa _k(G)$ and $\lambda _k(G)$
Wei, Zongtian +3 more
core +1 more source
Nonlinear analysis finds numerous applications in understanding the intricate characteristics of generalized Sierpinski graphs or chemical graphs. It aids in discerning the fractal patterns inherent in self-similar structures, deciphering the dynamic ...
J. Bhuvaneswari, D. Easwaramoorthy
doaj +1 more source
Vertex-, edge-, and total-colorings of Sierpiński-like graphs [PDF]
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
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
Domination parameters of generalized Sierpiński graphs
In 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
Kuramoto Model on Sierpinski Gasket I: Harmonic Maps
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
CONNECTEDNESS AND LOCAL CUT POINTS OF GENERALIZED SIERPIŃSKI CARPETS
We investigate a homeomorphism problem on a class of self-similar sets called generalized Sierpiński carpets (or shortly GSCs). It follows from two well-known results by Hata and Whyburn that a connected GSC is homeomorphic to the standard Sierpiński ...
Wang, Yang +4 more
core +1 more source
On Hamilton-Connectedness of Sierpiński Extension of Hamilton-Connected Graphs
Sierpiński networks have been extensively researched due to their fractal structure and their numerous scientific uses. The self-similar network, which is a generalized Sierpiński network, is generated by replicating the primary network.
Savari Prabhu +3 more
doaj +1 more source
Circle packings, renormalizations, and subdivision rules
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

