Results 51 to 60 of about 2,245,805 (347)
Unifying Two Graph Decompositions with Modular Decomposition [PDF]
, 2007 Soumis \`a ISAAC ...
Bui-Xuan, Binh-Minh +3 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
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
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
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
Rigidity of graph products of abelian groups
, 2007 We show that if $G$ is a group and $G$ has a graph-product decomposition with finitely-generated abelian vertex groups, then $G$ has two canonical decompositions as a graph product of groups: a unique decomposition in which each vertex group is a ...
Gutierrez, Mauricio, Piggott, Adam
core +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
Even-cycle decompositions of graphs with no odd-$K_4$-minor
, 2017 An even-cycle decomposition of a graph G is a partition of E(G) into cycles of even length. Evidently, every Eulerian bipartite graph has an even-cycle decomposition.
Huynh, Tony +2 more
core +1 more source
On Hamilton Decompositions of Line Graphs of Non-Hamiltonian Graphs and Graphs without Separating Transitions [PDF]
, 2017 In contrast with Kotzig's result that the line graph of a $3$-regular graph $X$ is Hamilton decomposable if and only if $X$ is Hamiltonian, we show that for each integer $k\geq 4$ there exists a simple non-Hamiltonian $k$-regular graph whose line graph ...
Bryant, Darryn +2 more
core +1 more source
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 +2 more
openaire +3 more sources