Results 51 to 60 of about 413,829 (102)
On multiparametrized integral inequalities via generalized α‐convexity on fractal set
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
The Sierpiński domination number [PDF]
Let $G$ and $H$ be graphs and let $f colon V(G)rightarrow V(H)$ be a function. The Sierpiński product of $G$ and $H$ with respect to $f$, denoted by $G otimes _f H$, is defined as the graph on the vertex set $V(G)times V(H)$, consisting of $|V(G ...
Kleszcz, Elżbieta +3 more
core +1 more source
Harmonic balls in Liouville quantum gravity
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
Minimum Cycle Base of Graphs Identified by Two Planar Graphs [PDF]
In this paper, we study the minimum cycle base of the planar graphs obtained from two 2-connected planar graphs by identifying an edge (or a cycle) of one graph with the corresponding edge (or cycle) of another, related with map geometries, i.e ...
Han, Ren, Dengju, Ma
core +1 more source
A low profile substrate‐integrated waveguide (SIW)‐based circular cavity‐backed slotted antenna is proposed at an operating frequency of 5.42 GHz for wireless applications in U‐NII‐2B band in the TM010 fundamental mode. Two hexagonal split ring‐shaped slots of 7 and 4 mm radius are placed on the patch as well as on the ground plane, resulting in ...
Rimi Sengupta +5 more
wiley +1 more source
(d, n)-packing coloring of generalized Sierpiński graphs [PDF]
V magistrski nalogi so opisani grafi Sierpińskega in njihove posplošitve, (d, n)-pakirno barvanje grafov ter računsko iskanje (d, n)-pakirnih kromatičnih števil. Razvili smo algoritem za generiranje grafov Sierpińskega z osnovo 4 ter implementirali štiri
Jeromel, Anže
core
Plick Graphs with Crossing Number 1 [PDF]
In this paper, we deduce a necessary and sufficient condition for graphs whose plick graphs have crossing number 1. We also obtain a necessary and sufficient condition for plick graphs to have crossing number 1 in terms of forbidden ...
Basavanagoud, B., Kulli, V.R.
core +1 more source
Monotone open homogeneity of Sierpiński curve [PDF]
This paper answers positively the open question of whether or not the Sierpiński curve is homogeneous with respect to monotone open maps. It constructs a monotone open map from the Sierpiński curve onto the Sierpiński curve.
Seaquist, Carl R., Carl R. Seaquist
core +1 more source
Vertex-, edge-, and total-colorings of Sierpiński-like graphs
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 + (
Marko Jakovac, Sandi Klavžar
core
Propagating Sets in Sierpiński Fractal Graphs
A set S of black colored vertices in a graph G is called a zero forcing set of G if at every discrete time step, a black vertex with exactly one non-black vertex as its neighbour forces it to be colored black and by iteratively applying the procedure ...
Hossein Rashmanlou +2 more
core +1 more source

