Results 31 to 40 of about 78 (70)

On the roman domination number of generalized Sierpiński graphs

open access: yes, 2017
A map f : V?(0,1,2) is a Roman dominating function on a graph G = (V,E) if for every vertex v ? V with f(v)=0, there exists a vertex u, adjacent to v, such that f(u)=2. The weight of a Roman dominating function is given by f(V)=?u?V f(u).
E.D. Rodríguez-Bazan   +2 more
core   +1 more source

Learning Image Fractals Using Chaotic Differentiable Point Splatting

open access: yesComputer Graphics Forum, Volume 44, Issue 2, May 2025.
Abstract Fractal geometry, defined by self‐similar patterns across scales, is crucial for understanding natural structures. This work addresses the fractal inverse problem, which involves extracting fractal codes from images to explain these patterns and synthesize them at arbitrary finer scales.
A. Djeacoumar   +3 more
wiley   +1 more source

Packing Coloring of Some Classes of Graphs with Recursive Structure

open access: yes, 2022
V doktorski disertaciji obravnavamo pakirna barvanja grafov. Ta predstavljajo eno izmed zelo raziskovanih variacij barvanj grafov. Doktorska disertacija je sestavljena iz treh delov, v sklopu katerih predstavimo rešitve različnih problemov v zvezi s ...
Ferme, Jasmina
core  

On multiparametrized integral inequalities via generalized α‐convexity on fractal set

open access: yesMathematical Methods in the Applied Sciences, Volume 48, Issue 1, Page 980-1002, 15 January 2025.
This article explores integral inequalities within the framework of local fractional calculus, focusing on the class of generalized α$$ \alpha $$‐convex functions. It introduces a novel extension of the Hermite‐Hadamard inequality and derives numerous fractal inequalities through a novel multiparameterized identity.
Hongyan Xu   +4 more
wiley   +1 more source

On distances in generalized Sierpiński graphs

open access: yes, 2018
In this paper we propose formulas for the distance between vertices of a generalized Sierpi?ski graph S(G, t) in terms of the distance between vertices of the base graph G.
Erick Rodríguez-Bazan   +2 more
core   +1 more source

Harmonic balls in Liouville quantum gravity

open access: yesProceedings of the London Mathematical Society, Volume 130, Issue 1, January 2025.
Abstract Harmonic balls are domains that satisfy the mean‐value property for harmonic functions. We establish the existence and uniqueness of harmonic balls on Liouville quantum gravity (LQG) surfaces using the obstacle problem formulation of Hele–Shaw flow.
Ahmed Bou‐Rabee, Ewain Gwynne
wiley   +1 more source

Graph Theoretical Description of Phase Transitions in Complex Multiscale Phases with Supramolecular Assemblies

open access: yesAdvanced Science, Volume 11, Issue 33, September 4, 2024.
Graphs representing molecules and their long‐range metrics provide an alternative toolbox to study phase transitions in complex multiscale phases with supramolecular assemblies, both for temperature and composition‐induced transitions, as these metrics can identify subtle changes in the structure of complex materials, quantify the amount of each phase,
Ruochen Yang   +7 more
wiley   +1 more source

Total Face Irregularity Strength of Certain Graphs

open access: yesMathematical Problems in Engineering, Volume 2024, Issue 1, 2024.
The edge k‐labeling ψ of G is defined by a mapping from E(G) to a set of integers {1, 2, …, k}, where the integer weight assigned to the vertex x ∈ V(G) is given as wψ(x) = ∑ψ(xy), such that the sum is taken over every vertex of y ∈ V(G) that is adjacent to x and the integer weights of adjacent vertices must be distinct for all vertices with x ≠ y.
D. Ahima Emilet   +4 more
wiley   +1 more source

Some properties of generalized Sierpiński graphs

open access: yes, 2019
V magistrskem delu so obravnavane in s slikovnimi zgledi predstavljene nekatere lastnosti posplošenih grafov Sierpińskega, zgrajenih na poljubnem baznem grafu G.
Bezgovšek, Teja
core  

Constructing disjoint Steiner trees in Sierpiński graphs

open access: yes
International audienceLet be a graph and with . Then the trees in are \emph{internally disjoint Steiner trees} connecting (or -Steiner trees) if and for every pair of distinct integers , .
Klasing, Ralf   +4 more
core   +1 more source

Home - About - Disclaimer - Privacy