Results 51 to 60 of about 2,192,848 (347)
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
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
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
Chain decompositions of graphs [PDF]
Bulletin of the Australian Mathematical Society, 1985 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +3 more sources
Fine-Grained Video-Text Retrieval With Hierarchical Graph Reasoning [PDF]
Computer Vision and Pattern Recognition, 2020 Cross-modal retrieval between videos and texts has attracted growing attentions due to the rapid emergence of videos on the web. The current dominant approach is to learn a joint embedding space to measure cross-modal similarities.
Shizhe Chen, Yida Zhao, Qin Jin, Qi Wu
semanticscholar +1 more source
Decomposition of perfect graphs
Journal of Combinatorial Theory, Series B, 1987 In this paper we describe general composition and decomposition schemes for perfect graphs, which covers almost all recent results in this area, e.g. the amalgam and the 2-amalgam split. Our approach is based on the consideration of induced cycles and their complements in perfect graphs (as opposed to the consideration of cycles for defining ...
openaire +2 more sources
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
Altered Dynamic Functional Network Connectivity in Post‐Stroke Aphasia
Annals of Clinical and Translational Neurology, EarlyView.ABSTRACT Objective Previous studies examining post‐stroke aphasia (PSA) patients via resting‐state functional magnetic resonance imaging (rs‐fMRI) have predominantly focused on static functional connectivity. In contrast, the current investigation aims to elucidate the alterations in dynamic functional network connectivity (dFNC) among PSA patients ...
Guihua Xu +6 more
wiley +1 more source
On the decomposition of a graph into stars
Discrete Mathematics, 1981 It is known that whenever υ(υ−1) ≡ 0 (mod 2m) and υ⩾2m, the complete graph Kυ can be decomposed into edge disjoint, m-stars [1,2]. In this paper we prove that Kυ can be decomposed into any given sequence of stars Sm1, Sm2,…, Smk if ∑mi=(2υ) and mi⩽1/2υ. Further we generalize this result to the decomposition of not necessarily complete graphs.
openaire +2 more sources