Results 21 to 30 of about 405,092 (308)
Some results on Steiner decomposition number of graphs
Kuwait Journal of Science, 2023 Let $G$ be a connected graph with Steiner number $s(G)$. A decomposition $\pi=\{G_1, G_2,..., G_n\}$ is said to be a Steiner decomposition if $s(G_i)=s(G)$ for all $i\:(1\leq i\leq n)$. The maximum cardinality obtained for the Steiner decomposition $\pi$
E.Ebin Raja Merly, M.Mahiba
doaj +1 more source
The Spectrum Problem for the Connected Cubic Graphs of Order 10
Discussiones Mathematicae Graph Theory, 2021 We show that if G is a connected cubic graph of order 10, then there exists a G-decomposition of Kv if and only if v ≣ 1 or 10 (mod 15) except when v = 10 and G is one of 5 specific graphs.
Adams Peter +3 more
doaj +1 more source
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
On tree-decompositions of one-ended graphs [PDF]
, 2018 A graph is one-ended if it contains a ray (a one way infinite path) and whenever we remove a finite number of vertices from the graph then what remains has only one component which contains rays. A vertex $v$ {\em dominates} a ray in the end if there are
Carmesin, Johannes +2 more
core +2 more sources
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
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
Low Diameter Graph Decompositions by Approximate Distance Computation [PDF]
, 2019 In many models for large-scale computation, decomposition of the problem is key to efficient algorithms. For distance-related graph problems, it is often crucial that such a decomposition results in clusters of small diameter, while the probability that ...
Becker, Ruben +2 more
core +2 more sources
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