Results 11 to 20 of about 696,277 (238)
Narumi–Katayama index of the subdivision graphs
Journal of Taibah University for Science, 2018 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 +4 more sources
Collaborative representation and confidence-driven semi-supervised learning for hyperspectral image classification [PDF]
Scientific ReportsHyperspectral image (HSI) classification faces challenges in diverse scenarios due to spectral-spatial complexity and class imbalance. Existing methods lack generalizability.
Yutian Chen +2 more
doaj +2 more sources
Mathematics, 2019 In this work, we study the degree-based topological invariants, and the general sum-connectivity, A B C 4 , G A 5 , general Zagreb, G A , generalized Randić, and A B C indices of the line graphs of some rooted product ...
Adnan Aslam +4 more
doaj +3 more sources
Structural analysis of transformations of subdivision graph via structure descriptors
Ain Shams Engineering JournalFor a graph X=(V(X),E(X)), a wide range of transformations are possible. A graph X can be converted into a new graph by adding vertices or edges following certain criteria.
Rashad Ismail +5 more
doaj +2 more sources
Domination Subdivision and Domination Multisubdivision Numbers of Graphs [PDF]
Discussiones Mathematicae Graph Theory, 2019 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 +2 more sources
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
Stacks, Queues and Tracks: Layouts of Graph Subdivisions [PDF]
Discrete Mathematics & Theoretical Computer Science, 2005 A k-stack layout (respectively, k-queuelayout) of a graph consists of a total order of the vertices, and a partition of the edges into k sets of non-crossing (non-nested) edges with respect to the vertex ordering.
Vida Dujmović, David R. Wood
doaj +2 more sources
Zagreb Indices and Coindices of Total Graph, Semi-Total Point Graph and Semi-Total Line Graph of Subdivision Graphs [PDF]
Mathematics Interdisciplinary Research, 2020 Expressions for the Zagreb indices and coindices of the total graph, semi-total point graph and of semi-total line graph of subdivision graphs in terms of the parameters of the parent graph are obtained, thus generalizing earlier existing results.
Harishchandra S. Ramane +2 more
doaj +1 more source
Multiplicative Zagreb indices and coindices of some derived graphs [PDF]
Opuscula Mathematica, 2016 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
On incidence coloring of graph fractional powers [PDF]
Opuscula Mathematica, 2022 For any \(n\in \mathbb{N}\), the \(n\)-subdivision of a graph \(G\) is a simple graph \(G^\frac{1}{n}\) which is constructed by replacing each edge of \(G\) with a path of length \(n\). The \(m\)-th power of \(G\) is a graph, denoted by \(G^m\), with the
Mahsa Mozafari-Nia, Moharram N. Iradmusa
doaj +1 more source