Results 41 to 50 of about 2,192,848 (347)
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
ON P4-DECOMPOSITION OF GRAPHS [PDF]
Taiwanese Journal of Mathematics, 2003 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +4 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
Decomposition of hypercube graphs into paths and cycles of length four
AKCE International Journal of Graphs and Combinatorics, 2022 By a [Formula: see text]-decomposition of a graph G, we mean a partition of the edge set of G into p paths of length 4 and q cycles of length 4. In this paper, we give conditions for a [Formula: see text]-decomposition of the n-dimensional hypercube ...
D. Saranya, S. Jeevadoss
doaj +1 more source
Image Clustering Algorithm Based on Hypergraph Regularized Nonnegative Tucker Decomposition [PDF]
Jisuanji gongcheng, 2022 The internal geometry structure of high-dimensional data is ignored when nonnegative tensor decomposition is applied to image clustering.To solve this problem, we propose a Hypergraph regularized Nonnegative Tucker Decomposition(HGNTD) model by adding a ...
CHEN Luyao, LIU Qilong, XU Yunxia, CHEN Zhen
doaj +1 more source
Embedding rainbow trees with applications to graph labelling and decomposition [PDF]
Journal of the European Mathematical Society (Print), 2018 A subgraph of an edge-coloured graph is called rainbow if all its edges have distinct colours. The study of rainbow subgraphs goes back more than two hundred years to the work of Euler on Latin squares.
R. Montgomery, A. Pokrovskiy, B. Sudakov
semanticscholar +1 more source
DECOMPOSITIONS OF THE FREE PRODUCT OF GRAPHS [PDF]
Infinite Dimensional Analysis, Quantum Probability and Related Topics, 2007 We study the free product of rooted graphs and its various decompositions using quantum probabilistic methods. We show that the free product of rooted graphs is canonically associated with free independence, which completes the proof of the conjecture that there exists a product of rooted graphs canonically associated with each notion of ...
ACCARDI, LUIGI +2 more
openaire +4 more sources
GSD: An R package for graph signal decomposition
SoftwareXGraph signals residing on the vertices of a graph have recently gained prominence in research of various fields, including neural networks, social networks, traffic patterns, and sensors.
Hyeonglae Cho, Hee-Seok Oh, Donghoh Kim
doaj +1 more source
A note on pm-compact bipartite graphs
Discussiones Mathematicae Graph Theory, 2014 A graph is called perfect matching compact (briefly, PM-compact), if its perfect matching graph is complete. Matching-covered PM-compact bipartite graphs have been characterized. In this paper, we show that any PM-compact bipartite graph G with δ (G) ≥ 2
Liu Jinfeng, Wang Xiumei
doaj +1 more source
Clique decompositions of multipartite graphs and completion of Latin squares [PDF]
, 2017 Our main result essentially reduces the problem of finding an edge-decomposition of a balanced r-partite graph of large minimum degree into r-cliques to the problem of finding a fractional r-clique decomposition or an approximate one.
Barber, Ben +4 more
core +4 more sources