Results 11 to 20 of about 974,445 (260)
An interpolatory subdivision algorithm for surfaces over arbitrary triangulations [PDF]
, 1992 In this paper, an interpolatory subdivision algorithm for surfaces over ar-bitrary triangulations is introduced and its convergence properties over nonuni-form triangulations studied.
Qu, R
core +6 more sources
Uniform subdivision algorithms for curves and surfaces [PDF]
, 1988 A convergence analysis for studying the continuity and differentiability of limit curves generated by uniform subdivision algorithms is presented. The analysis is based on the study of corresponding difference and divided difference algorithms.
Gregory, JA, Dyn, N, Levin, D
core +6 more sources
Recursive subdivision algorithms for curve and surface design [PDF]
, 1990 This thesis was submitted for the degree of Doctor of Philosophy and awarded by Brunel University.In this thesis, the author studies recursIve subdivision algorithms for curves and surfaces. Several subdivision algorithms are constructed and investigated.
Qu, Ruibin
core +7 more sources
Odd edge‐colorings of subdivisions of odd graphs
Journal of Graph Theory, 2023 AbstractAn odd graph is a finite graph all of whose vertices have odd degrees. A graph is decomposable into odd subgraphs if its edge set can be partitioned into subsets each of which induces an odd subgraph of . The minimum value of for which such a decomposition of exists is the odd chromatic index, , introduced by Pyber.
Mirko Petrusevski, Riste Skrekovski
openaire +3 more sources
Szeged-type indices of subdivision vertex-edge join (SVE-join)
Main Group Metal Chemistry, 2021 In this article, we compute the vertex Padmakar-Ivan (PIv) index, vertex Szeged (Szv) index, edge Padmakar-Ivan (PIe) index, edge Szeged (Sze) index, weighted vertex Padmakar-Ivan (wPIv) index, and weighted vertex Szeged (wSzv) index of a graph product ...
Asghar Syed Sheraz +4 more
doaj +1 more source
A 10-point interpolatory recursive subdivision algorithm for the generation of parametric surfaces [PDF]
, 1991 In this paper, an interpolatory subdivision algorithm for surfaces over arbitrary triangulations is introduced and its properties over uniform triangulations studied.
Gregory, JA, Qu, R
core +6 more sources
Eternal m-security subdivision numbers in trees [PDF]
Communications in Combinatorics and Optimization, 2019 An eternal $m$-secure set of a graph $G = (V,E)$ is a set $S_0\subseteq V$ that can defend against any sequence of single-vertex attacks by means of multiple-guard shifts along the edges of $G$. A suitable placement of the guards is called an eternal
M. Atapour
doaj +1 more source
Sombor Index Under Some Graph Products [PDF]
Mathematics Interdisciplinary Research, 2022 Let G=(V, E) be a graph with vertex set V(G) and edge set E(G). The Sombor index of a graph G, SO(G), is defined as ∑uv∈ E(G) √(d2u+d2v), where du is the degree of vertex u in V(G). In the present paper, we determine the lower bound for the
Irandokht Rezaee Abdolhosseinzadeh +2 more
doaj +1 more source
Nonrepetitively 3-Colorable Subdivisions of Graphs with a Logarithmic Number of Subdivisions per edge [PDF]
The Electronic Journal of Combinatorics, 2021 We show that for every graph $G$ and every graph $H$ obtained by subdividing each edge of $G$ at least $\Omega(\log |V(G)|)$ times, $H$ is nonrepetitively 3-colorable. In fact, we show that $\Omega(\log \pi'(G))$ subdivisions per edge are enough, where $\pi'(G)$ is the nonrepetitive chromatic index of $G$.
openaire +4 more sources
Enabling and Leveraging AI in the Intelligent Edge: A Review of Current Trends and Future Directions
IEEE Open Journal of the Communications Society, 2021 The use of AI on Smart applications and in the organization of the network edge presents a rapidly advancing research field, with a great variety of challenges and opportunities. This article aims to provide a holistic review of studies from 2019 to 2021
Tom Goethals +2 more
doaj +1 more source