Results 31 to 40 of about 413,829 (102)

On the number of spanning trees, the Laplacian eigenvalues, and the Laplacian Estrada index of subdivided-line graphs

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

Kuramoto Model on Sierpinski Gasket I: Harmonic Maps

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

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

Patterning the Void: Combining L‐Systems with Archimedean Tessellations as a Perspective for Tissue Engineering Scaffolds

open access: yesAdvanced Functional Materials, Volume 36, Issue 23, 19 March 2026.
This study introduces a novel multi‐scale scaffold design using L‐fractals arranged in Archimedean tessellations for tissue regeneration. Despite similar porosity, tiles display vastly different tensile responses (1–100 MPa) and deformation modes. In vitro experiments with hMSCs show geometry‐dependent growth and activity. Over 55 000 tile combinations
Maria Kalogeropoulou   +4 more
wiley   +1 more source

Modelling complex networks by random hierarchical graphs

open access: yesCondensed 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   +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

Some generalizations of Sierpiński graphs [PDF]

open access: yes, 2013
V diplomskem delu so predstavljeni grafi Sierpińskijevega tipa, in sicer grafi Sierpińskega S(n, k), grafi trikotnikov Sierpińskega S_n, regularni grafi Sierpińskega S^+(n, k) in S^++(n, k) ter posplošeni grafi trikotnikov Sierpińskega S[n, k]. Prikazane
Šereg, Andreja
core  

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

Topological indices for the iterations of Sierpiński rhombus and Koch snowflake

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

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

Home - About - Disclaimer - Privacy