Results 41 to 50 of about 2,151,737 (304)
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
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
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
ON P4-DECOMPOSITION OF GRAPHS [PDF]
Taiwanese Journal of Mathematics, 2003 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +3 more sources
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
Discrete Mathematics, 2002 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Yair Caro, Raphael Yuster
openaire +2 more sources
Shared-Memory Graph Truss Decomposition [PDF]
International Conference on High Performance Computing, 2017 We present PKT, a new shared-memory parallel algorithm and OpenMP implementation for the truss decomposition of large sparse graphs. A k-truss is a dense subgraph definition that can be considered a relaxation of a clique. Truss decomposition refers to a
H. Kabir, Kamesh Madduri
semanticscholar +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
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
Density decompositions of networks
Journal of Graph Algorithms and Applications, 2019 We introduce a new topological descriptor of a graph called the density decomposition which is a partition of the vertices of a graph into regions of uniform density.
Glencora Borradaile +2 more
doaj +1 more source