Results 21 to 30 of about 974,445 (260)
Let G be a graph with p vertices and q edges and be an injective function, where k is a positive integer. If the induced edge labeling defined by for each is a bijection, then the labeling f is called an odd Fibonacci edge irregular labeling of G.
M. Uma Devi, M. Kamaraj, S. Arockiaraj
doaj +1 more source
Subword complexes and edge subdivisions [PDF]
For a finite Coxeter group, a subword complex is a simplicial complex associated with a pair (Q, π), where Q is a word in the alphabet of simple reflections, $π$ is a group element. We discuss the transformations of such a complex induced by braid moves of the word Q.
openaire +3 more sources
The vertex distance complement (VDC) matrix \(\textit{C}\), of a connected graph \(G\) with vertex set consisting of \(n\) vertices, is a real symmetric matrix \([c_{ij}]\) that takes the value \(n - d_{ij}\) where \(d_{ij}\) is the distance between the
Ann Susa Thomas +2 more
doaj +1 more source
Variational reconstruction using subdivision surfaces with continuous sharpness control
We present a variational method for subdivision surface reconstruction from a noisy dense mesh. A new set of subdivision rules with continuous sharpness control is introduced into Loop subdivision for better modeling subdivision surface features such as ...
Xiaoqun Wu +3 more
doaj +1 more source
Narumi–Katayama index of the subdivision graphs
Subdivision is an important aspect in graph theory which allows one to calculate properties of some complicated graphs in terms of some easier graphs. Recently, the notion of r-subdivision was similarly defined as a quite useful generalization by adding ...
Merve Ascioglu, Ismail Naci Cangul
doaj +1 more source
Multiplicative Zagreb indices and coindices of some derived graphs [PDF]
In this note, we obtain the expressions for multiplicative Zagreb indices and coindices of derived graphs such as a line graph, subdivision graph, vertex-semitotal graph, edge-semitotal graph, total graph and paraline graph.
Bommanahal Basavanagoud, Shreekant Patil
doaj +1 more source
Analysis of uniform binary subdivision schemes for curve design [PDF]
The paper analyses the convergence of sequences of control polygons produced by a binary subdivision scheme of the form .0,1,2,...kz,ikj,ifjbm0j1k12ifjam0j1k2if=∈+Σ==++Σ==+ The convergence of the control polygons to a Cu curve is analysed in terms of ...
Gregory, JA, Dyn, N, Levin, D
core +6 more sources
Domination Subdivision and Domination Multisubdivision Numbers of Graphs
The domination subdivision number sd(G) of a graph G is the minimum number of edges that must be subdivided (where an edge can be subdivided at most once) in order to increase the domination number of G. It has been shown [10] that sd(T) ≤ 3 for any tree
Dettlaff Magda +2 more
doaj +1 more source
Irregularity Measures of Subdivision Vertex-Edge Join of Graphs
The study of graphs and networks accomplished by topological measures plays an applicable task to obtain their hidden topologies. This procedure has been greatly used in cheminformatics, bioinformatics, and biomedicine, where estimations based on graph ...
Jialin Zheng +6 more
doaj +1 more source
In this article, we present a new method to construct a family of 2N+2-point binary subdivision schemes with one tension parameter. The construction of the family of schemes is based on repeated local translation of points by certain displacement vectors.
Rabia Hameed +3 more
doaj +1 more source

