Results 21 to 30 of about 78 (70)

Circle packings, renormalizations, and subdivision rules

open access: yesProceedings 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

Graphs $S(n,k)$ and a variant of the Tower of Hanoi problem [PDF]

open access: yes, 1997
summary:For any $n\ge 1$ and any $k\ge 1$, a graph $S(n,k)$ is introduced. Vertices of $S(n,k)$ are $n$-tuples over $\lbrace 1, 2, \ldots , k\rbrace $ and two $n$-tuples are adjacent if they are in a certain relation.
Klavžar, Sandi, Milutinović, Uroš
core   +1 more source

Multidimensional Topological Measure Spaces and Their Applications in Decision‐Making Problems

open access: yesAdvances in Fuzzy Systems, Volume 2026, Issue 1, 2026.
This paper presents a generalized framework termed the multidimensional topological measure space (MDTMS), developed through multidimensional fuzzy sets, multidimensional topology, and an associated distance measure. The suggested framework enhances traditional fuzzy models by facilitating a more nuanced representation and examination of intricate ...
Jomal Josen   +3 more
wiley   +1 more source

New Sharp Extremal Bounds for the Randić Index of Trees With Prescribed Roman Domination Number

open access: yesDiscrete Dynamics in Nature and Society, Volume 2026, Issue 1, 2026.
The Randić index is a classical degree‐based topological index that captures branching features of a graph and has broad applications in chemical graph theory and related network models. Roman domination is a defense‐inspired covering concept in which vertices are assigned protective labels so that every unprotected vertex is adjacent to a strongly ...
Waqar Ali   +4 more
wiley   +1 more source

Injective colorings of Sierpiński-like graphs and Kneser graphs

open access: yes
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

Metaheuristic Optimization Algorithm for Vulnerability Detection in Web of Things Environment

open access: yesJournal of Engineering, Volume 2026, Issue 1, 2026.
The integration of the Web of Things with cloud computing platforms has significantly improved data sharing, analytics, and automation across smart environments. However, this interconnection also exposes devices and cloud infrastructures to severe security threats, including Trojans, ransomware, worms, and advanced malware.
Romil Rawat   +2 more
wiley   +1 more source

New Mathematical Frameworks for Entire Topological Indices and Their Applications in Chemical Modeling

open access: yesJournal of Mathematics, Volume 2026, Issue 1, 2026.
Topological indices are essential for encoding molecular information and have traditionally focused on the properties of individual atoms and their connections. In this work, we study and analyze the first and second entire Zagreb indices. We explore their predictive power through rigorous analysis of octane isomers and benzenoid hydrocarbons ...
Buthinah A. Bin Dehaish   +3 more
wiley   +1 more source

First‐order Sobolev spaces, self‐similar energies and energy measures on the Sierpiński carpet

open access: yesCommunications on Pure and Applied Mathematics, Volume 78, Issue 9, Page 1523-1608, September 2025.
Abstract For any p∈(1,∞)$p \in (1,\infty)$, we construct p$p$‐energies and the corresponding p$p$‐energy measures on the Sierpiński carpet. A salient feature of our Sobolev space is the self‐similarity of energy. An important motivation for the construction of self‐similar energy and energy measures is to determine whether or not the Ahlfors regular ...
Mathav Murugan, Ryosuke Shimizu
wiley   +1 more source

Connectivity and some other properties of generalized Sierpiński graphs

open access: yes, 2018
If G is a graph and n a positive integer, then the generalized Sierpi?ski graph SnG is a fractal-like graph that uses G as a building block. The construction of SnG generalizes the classical Sierpi?ski graphs Sn p, where the role of G is played ...
Sara Zemljic, Sandi Klavzar
core   +1 more source

Fractal Scaling of Explosively Driven Product Gases

open access: yesPropellants, Explosives, Pyrotechnics, Volume 50, Issue 5, May 2025.
The expanding interface between explosive product gases and ambient air is characterized as a function of time by the fractal dimension of the interface which is extracted from high‐speed image sequences. The interface is observed to increase in fractal dimension, and thus complexity, as time from detonation progresses.
Christian R. Peterson   +1 more
wiley   +1 more source

Home - About - Disclaimer - Privacy