Results 11 to 20 of about 87,339 (166)
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 +5 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 +4 more sources
Multiple Petersen subdivisions in permutation graphs [PDF]
The Electronic Journal of Combinatorics, 2012 A permutation graph is a cubic graph admitting a 1-factor M whose complement consists of two chordless cycles. Extending results of Ellingham and of Goldwasser and Zhang, we prove that if e is an edge of M such that every 4-cycle containing an edge of M ...
Kaiser, Tomáš +2 more
core +3 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
Resolvability in Subdivision Graph of Circulant Graphs
Symmetry, 2023 Circulant networks are a very important and widely studied class of graphs due to their interesting and diverse applications in networking, facility location problems, and their symmetric properties. The structure of the graph ensures that it is symmetric about any line that cuts the graph into two equal parts.
Syed Ahtsham Ul Haq Bokhary +5 more
openaire +3 more sources
IEEE Access, 2018 The resistance distance is widely used in random walk, electronic engineering, and complex networks. One of the main topics in the study of the resistance distance is the computation problem.
Qun Liu, Jia-Bao Liu, Shaohui Wang
doaj +3 more sources
Line and Subdivision Graphs Determined by T 4 -Gain Graphs [PDF]
Mathematics, 2019 Let T 4 = { ± 1 , ± i } be the subgroup of fourth roots of unity inside T , the multiplicative group of complex units. For a T 4 -gain graph Φ = ( Γ , T 4 , φ ) , we introduce gain functions on its line graph L ( Γ ) and on its subdivision graph S ( Γ ) . The corresponding gain graphs L ( Φ ) and
Abdullah Alazemi +4 more
openaire +4 more sources
Triangular Mesh Surface Subdivision Based on Graph Neural Network
Applied SciencesMesh subdivision is a common mesh-processing algorithm used to improve model accuracy and surface smoothness. Its classical scheme adopts a fixed linear vertex update strategy and is implemented iteratively, which often results in excessive mesh ...
Guojun Chen, Rongji Wang
doaj +3 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 +3 more sources