Global ETD Search

Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.

Results

Showing 1 to 3 of 3 for “"clique graph"”.

  1. The Structure and Properties of Clique Graphs of Regular Graphs

    … structure and properties of <em>G </em>and its clique graph <em>cl</em><sub><em>t</em></sub><em> </em>(<em>G</em>) are analyzed for graphs <em>G </em>that are non-complete, regular with degree <em>δ </em>, and where every edge of <em>G </em>is contained in a <em>t </em>-clique. In a clique graph

    usm Repository record for The Structure and Properties of Clique Graphs of Regular Graphs (opens in a new tab)

  2. Tesselações em grafos e suas aplicações em computação quântica

    … finding a marked vertex in a bipartite Johnson graph, requiring O(Nk/k+1) steps, which is better than any known classical approach. This procedure was later generalized by Szegedy in a new model of quantum walks consisting on a walk through the edges of a bipartite graph. Recently, Portugal et …

    brazil-uerj Repository record for Tesselações em grafos e suas aplicações em computação quântica (opens in a new tab)

  3. Voltooiingsprobleme vir klasse van reële simmetriese matrikse wat geslote konvekse keëls vorm

    … SPN matrices are directly related to a certain graph that represents the partial matrices, namely the specification graph. It is shown that partial positive semidefinite matrices (and partial positive definite matrices) are completable if and only if the specification graph is chordal. In the …

    nwu-za Repository record for Voltooiingsprobleme vir klasse van reële simmetriese matrikse wat geslote konvekse keëls vorm (opens in a new tab)