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
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
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 +3 more sources
Independent Domination Subdivision in Graphs [PDF]
Graphs and Combinatorics, 2021 AbstractA set S of vertices in a graph G is a dominating set if every vertex not in S is ad jacent to a vertex in S. If, in addition, S is an independent set, then S is an independent dominating set. The independent domination number i(G) of G is the minimum cardinality of an independent dominating set in G.
Babikir, Ammar +3 more
openaire +1 more source
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
Balanced Subdivisions of Cliques in Graphs
Combinatorica, 2023 18 pages, 2 ...
Luan, Bingyu +3 more
openaire +3 more sources
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
Edge subdivision and edge multisubdivision versus some domination related parameters in generalized corona graphs [PDF]
Opuscula Mathematica, 2016 Given a graph \(G=(V,E)\), the subdivision of an edge \(e=uv\in E(G)\) means the substitution of the edge \(e\) by a vertex \(x\) and the new edges \(ux\) and \(xv\).
Magda Dettlaff +2 more
doaj +1 more source
Two Complex Graph Operations and their Exact Formulations on Topological Properties
Complexity, 2022 Graph operations are utilized for developing complicated graph structures from basic graphs, and these basic graphs can help to understand the properties of complex networks. While on the other side, the topological descriptor is known as a numeric value
Shehla Hameed +4 more
doaj +1 more source