Results 21 to 30 of about 46,387 (243)
Hyperspectral Image Super-Resolution Algorithm Based on Graph Regular Tensor Ring Decomposition
Remote Sensing, 2023 This paper introduces a novel hyperspectral image super-resolution algorithm based on graph-regularized tensor ring decomposition aimed at resolving the challenges of hyperspectral image super-resolution.
Shasha Sun +5 more
doaj +1 more source
Local Balance in Graph Decompositions [PDF]
Graphs and Combinatorics, 2022 In a balanced graph decomposition, every vertex of the host graph appears in the same number of blocks. We propose the use of colored loops as a framework for unifying various other types of local balance conditions in graph decompositions. In the basic case where a single graph with colored loops is used as a block, an existence theory for such ...
Flora C. Bowditch, Peter J. Dukes
openaire +2 more sources
Edge-partitioning graphs into regular and locally irregular components [PDF]
Discrete Mathematics & Theoretical Computer Science, 2016 A graph is locally irregular if every two adjacent vertices have distinct degrees. Recently, Baudon et al. introduced the notion of decomposition into locally irregular subgraphs.
Julien Bensmail, Brett Stevens
doaj +1 more source
A C3 Magic Decomposition on Friendship Graph with Odd Order
Jurnal Ilmu Dasar, 2022 Let G = (V,E) is graph with a non-empty set V containing vertices and a set of edges E. Also note that if H = {H_i⊆G_i = 1,2,3,...,n} is a collection of subgraphs from G with H_i≅Hj,i ≠ j.
Indah Chairun Nisa +2 more
doaj +1 more source
Optimizing tree decompositions in MSO [PDF]
Logical Methods in Computer Science, 2022 The classic algorithm of Bodlaender and Kloks [J. Algorithms, 1996] solves the following problem in linear fixed-parameter time: given a tree decomposition of a graph of (possibly suboptimal) width k, compute an optimum-width tree decomposition of the ...
Mikołaj Bojańczyk, Michał Pilipczuk
doaj +1 more source
Structural Decomposition Model for the Evolution of AS-Level Internet Topologies
IEEE Access, 2020 Modeling Internet graphs at the autonomous-system (AS) level is helpful for recognizing and predicting the development trend of evolving Internet topology from a macro perspective.
Bo Jiao, Wensheng Zhang
doaj +1 more source
Automorphic Decompositions of Graphs
Graphs and Combinatorics, 2010 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Beeler, Robert A., Jamison, Robert E.
openaire +3 more sources
Claw-decomposition of Kneser graphs
Transactions on Combinatorics, 2022 Summary: A claw is a star with three edges. The Kneser graph \(KG_{n, 2}\) is the graph whose vertices are the 2-subsets of an \(n\)-set, in which two vertices are adjacent if and only if their intersection is empty. In this paper, we prove that \(KG_{n, 2}\) is claw-decomposable, for all \(n\geq 6\).
C, Sankari, R, Sangeetha, Arthi, K.
openaire +3 more sources
Decomposition of complete graphs into connected unicyclic graphs with eight edges and pentagon
Indonesian Journal of Combinatorics, 2019 A G-decomposition of the complete graph Kn is a family of pairwise edge disjoint subgraphs of Kn, all isomorphic to G, such that every edge of Kn belongs to exactly one copy of G.
Dalibor Froncek, O'Neill Kingston
doaj +1 more source
Fast Spectral Approximation of Structured Graphs with Applications to Graph Filtering
Algorithms, 2020 To analyze and synthesize signals on networks or graphs, Fourier theory has been extended to irregular domains, leading to a so-called graph Fourier transform.
Mario Coutino +3 more
doaj +1 more source