Results 31 to 40 of about 696,277 (238)
The harmonic index of subdivision graphs [PDF]
Transactions on Combinatorics, 2017 The harmonic index of a graph $G$ is defined as the sum of the weights $frac{2}{deg_G(u)+deg_G(v)}$ of all edges $uv$ of $G$, where $deg_G(u)$ denotes the degree of a vertex $u$ in $G$. In this paper, we study the harmonic index of subdivision
Bibi Naimeh Onagh
doaj +1 more source
Rainbow game domination subdivision number of a graph [PDF]
Romanian Journal of Mathematics and Computer Science, 2014 The rainbow game domination subdivision number of a graph G is defined by the following game. Two players D and A, D playing first, alternately mark or subdivide an edge of G which is not yet marked nor subdivided.
J. Amjadi
doaj
DOMINATION NUMBER AND IDENTIFYING CODE NUMBER OF THE SUBDIVISION GRAPHS [PDF]
Journal of Algebraic SystemsLet $G=(V, E)$ be a simple graph. A set $C$ of vertices of $G$ is an identifying code of $G$ if for every two vertices $x$ and $y$ the sets $N_{G}[x] \cap C$ and $N_{G}[y] \cap C$ are non-empty and different.
Somaiya Ahmadi +2 more
doaj +1 more source
Degree-Based Topological Indices of Generalized Subdivision Double-Corona Product
Journal of Chemistry, 2022 Graph operations play an important role in constructing complex network structures from simple graphs. Computation of topological indices of these complex structures via graph products is an important task.
Ying Wang +5 more
doaj +1 more source
Gaussian Tribonacci R-Graceful Labeling of Some Tree Related Graphs
Ratio Mathematica, 2022 Let r be any natural number. An injective function , where is the Gaussian Tribonacci number in the Gaussian Tribonacci sequence is said to be Gaussian Tribonacci r-graceful labeling if the induced edge labeling such that is bijective.
K Sunitha, M Sheriba
doaj +1 more source
Further results on (1,0,0)-F-Face magic mean graphs [PDF]
Songklanakarin Journal of Science and Technology (SJST), 2020 A (1,0,0)-F-Face magic mean labeling is an assignment of labels to the vertices of planar graph such that the mean weight of each face including an exterior face is constant.
A. Meena Kumari, S. Arockiaraj
doaj +1 more source
Complexity of subdivision-vertex and subdivision-edge join graphs
, 2022 The entropy of a graph is an information-theoretic quantity which expresses the complexity of a graph. The generalized graph entropies result from applying information measures to a graph using various schemes for defining probability distributions over ...
Berberler, Zeynep Nihan
core +1 more source
IEEE Access, 2019 Let G be a connected graph. The subdivision graph S(G) of a graph (G) is the graph obtained by inserting a new vertex into every edge of G. The set of such new vertices is denoted by I(G).
Qun Liu
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 +4 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 +6 more sources