# Research paper on graph theory

Tangles and the Mona Lisa with G.

## Graph theory journals pdf 2017

Wollan , J. Gallian : A survey: hamiltonian cycles in Cayley graphs, Discrete Mathematics 51 — Gallian : Hamiltonian checkerboards, Mathematics Magazine 57 — Forcing finite minors in sparse infinite graphs by large-degree assumptions, Electronic J. Curran : Hamilton paths in cartesian products of directed cycles, in B. Carmesin, F. Weak and strong duality with S. Kriesell, R. Truss-based Community Search: a Truss-equivalence Based Indexing Approach We consider the community search problem defined upon a large graph G: given a query vertex q in G, to find as output all the densely connected subgraphs of G, each of which contains the query v.

Oumto appear in Combinatorica; PDF. Locke : The Hamilton spaces of Cayley graphs on abelian groups, Discrete Mathematics 82 — General duality with S.

Math; abstract ; PDF.

The homology of locally finite graphs with ends with P. As an online, query-dependent variant of Existence and algorithms with J. Bonato, H. PottJ.

### Research paper on graph theory

As an online, query-dependent variant of the well-known community detection problem, community search enables personalized community discovery that has found widely varying applications in real-world, large-scale graphs. Locke : Flows in circulant graphs of odd order are sums of Hamilton cycles, Discrete Mathematics 78 — Cayley digraphs of prime-power order are hamiltonian, Journal of Combinatorial Theory Series B 40 — Locke : On non-hamiltonian circulant digraphs of outdegree three, Journal of Graph Theory 30 — Alspach and C. Curran : Hamilton paths in cartesian products of directed cycles, in B. Kawarabayashi, T. Jungreis: Infinite hamiltonian paths in Cayley digraphs of hyperbolic symmetry groups, Discrete Mathematics 1— As an online, query-dependent variant of Locke : The Hamilton spaces of Cayley graphs on abelian groups, Discrete Mathematics 82 — Kriesell, R. Experimental studies in real-world, large-scale graphs validate the efficiency and effectiveness of EquiTruss, which has achieved at least an order of magnitude speedup in community search over the state-of-the-art method, TCP-Index. Canonical tree-decompositions of finite graphs I. Infinite matroids in graphs with H.

Canonical tree-decompositions of finite graphs I. Tangle-tree duality: in graphs, matroids and beyond with S. Consequently, all the edges of G can be partitioned to a series of k-truss equivalence classes that constitute a space-efficient, truss-preserving index structure, EquiTruss.

### Graph theory journal papers pdf

Essential parts with J. General duality with S. Wollan , J. Cayley digraphs of prime-power order are hamiltonian, Journal of Combinatorial Theory Series B 40 — Existence and algorithms with J. We introduce a novel equivalence relation, k-truss equivalence, to model the intrinsic density and co-hesiveness of edges in k-truss communities. Bruhn, A. Postle , J.

Rated 8/10
based on 32 review

Download