Results 31 to 40 of about 46,387 (243)

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

List decomposition of graphs

Discrete Mathematics, 2002
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Caro, Yair, Yuster, Raphael
openaire   +2 more sources

Unifying Two Graph Decompositions with Modular Decomposition [PDF]

, 2007
Soumis \`a ISAAC ...
Bui-Xuan, Binh-Minh, Habib, Michel, Limouzy, Vincent, de Montgolfier, Fabien   +3 more
openaire   +4 more sources

GSD: An R package for graph signal decomposition

SoftwareX
Graph 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

The Balanced Decomposition Number of TK4 and Series-Parallel Graphs

Discussiones Mathematicae Graph Theory, 2013
A balanced colouring of a graph G is a colouring of some of the vertices of G with two colours, say red and blue, such that there is the same number of vertices in each colour. The balanced decomposition number f(G) of G is the minimum integer s with the
Fujita Shinya, Liu Henry
doaj   +1 more source

Detour self-decomposition of corona product of graphs

Ratio Mathematica, 2023
Decomposition of a graph G is the collection of edge-disjoint subgraphs of G. The longest distance between any two vertices of G is its detour distance.
E Ebin Raja Merly, E Anlin Bena
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

Monochromatic Clique Decompositions of Graphs

Journal of Graph Theory, 2015
AbstractLet G be a graph whose edges are colored with k colors, and be a k‐tuple of graphs. A monochromatic ‐decomposition of G is a partition of the edge set of G such that each part is either a single edge or forms a monochromatic copy of in color i, for some .
Henry Liu, Oleg Pikhurko, Teresa Sousa
openaire   +4 more sources

Decompositions of triangle-dense graphs [PDF]

Proceedings of the 5th conference on Innovations in theoretical computer science, 2014
High triangle density -- the graph property stating that a constant fraction of two-hop paths belong to a triangle -- is a common signature of social networks. This paper studies triangle-dense graphs from a structural perspective. We prove constructively that significant portions of a triangle-dense graph are contained in a disjoint union of dense ...
Gupta, Rishi, Roughgarden, Tim, Seshadhri, C.   +2 more
openaire   +3 more sources