Results 271 to 280 of about 2,151,737 (304)

Decomposition of Graphs into Chains

Bulletin of the London Mathematical Society, 1986
A one-way infinite chain in a graph is a sequence \(X_0e_0X_1e_1,\ldots\) where \(X_0,X_1,\ldots\) are vertices of \(G\), \(e_0,e_1,\ldots\) are distinct edges of \(G\) and \(e_i\) joins \(X_i\) and \(X_{i+1}\) for \(i=0,1,\ldots\). A two-way infinite chain and a finite chain are defined analogously.
openaire   +2 more sources

Chromatically Supremal Decompositions of Graphs

Graphs and Combinatorics, 2010
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Robert E. Jamison, Eric Mendelsohn
openaire   +1 more source

Canonical Decomposition of Graphs

1996
Summary: A partition of the vertex set of a graph \(G\) is called canonical if every two elements of the partition induce in \(G\) either a disconnected graph or the complement of a disconnected graph. Thus, every canonical partition of the graph \(G\) can be associated with another graph whose vertices are in a one-to-one correspondence with the ...
openaire   +2 more sources

Graph Decomposition Approaches for Terminology Graphs

2007
We propose a graph-based decomposition methodology of a network of document features represented by a terminology graph. The graph is automatically extracted from raw data based on Natural Language Processing techniques implemented in the TermWatch system. These graphs are Small Worlds.
Didi Biha, Mohamed, Kaba, Bangaly, Meurs, Marie-Jean, Sanjuan, Eric   +3 more
openaire   +2 more sources

Graph decompositions and symmetry

2009
In this paper I shall try to review some results which were obtained in the area of factorizations and decompositions of complete graphs admitting an automorphism group with some specified properties. These properties primarily involve the action of the group on the objects of the decomposition, most oftenvertices, but also edges, subgraphs of the ...
openaire   +2 more sources

Coloured Graph Decompositions

Let G be a graph in which each vertex has been coloured using one of k colours, say C1, c2, …, ck. If a graph H in G has ni vertices coloured ci i = 1, 2, ... , k, and |ni –nj| < 1 for any i , j Є {1, 2, . . . , k}, then H is said to be equitably k-coloured.
openaire   +2 more sources

Connected graph decomposition for spectral clustering

Multimedia tools and applications, 2018
Tao Tong, Xiaofeng Zhu, Tingting Du
semanticscholar   +1 more source

Studying the use and effect of graph decomposition in qualitative spatial and temporal reasoning

Knowledge engineering review (Print), 2017
Michael Sioutis, Y. Salhi, Jean-François Condotta   +2 more
semanticscholar   +1 more source

Core Graph Decomposition

Encyclopedia of Social Network Analysis and Mining. 2nd Ed., 2018

semanticscholar   +1 more source

3K2-decomposition of a graph

Acta Mathematica Academiae Scientiarum Hungaricae, 1982
Bialostocki, A., Roditty, Y.
openaire   +1 more source