In graph theory, the bipartite double cover of an undirected graph G is a bipartite covering graph of G, with twice as many vertices as G. It can be… (More)

(More)

Semantic Scholar uses AI to extract papers important to this topic.

2018

2017

2017

- Thomas G. Wong
- Quantum Information Processing
- 2017

Szegedy’s quantum walk is a quantization of a classical random walk or Markov chain, where the walk occurs on the edges of the… (More)

Is this relevant?

2012

2012

- Christian Schridde
- ArXiv
- 2012

In this paper, we build on the idea of Valiant [13] and Ben-Dor/Halevi [3], that is, to count the number of satisfying solutions… (More)

Is this relevant?

2011

2011

We construct two families of distance-regular graphs, namely the subgraph of the dual polar graph of type B3(q) induced on the… (More)

Is this relevant?

2008

2008

- Steve Wilson
- J. Comb. Theory, Ser. B
- 2008

This paper considers instability of graphs in all of its possible forms. First, four theorems (one with two interesting special… (More)

Is this relevant?

2007

2007

- Beifang Chen, Jue Wang
- 2007

We completely describe the structure of irreducible integral flows on a signed graph by lifting them to the signed double… (More)

Is this relevant?

2006

2006

- Hovhannes A. Harutyunyan, Edward Maraachlian
- Tenth International Conference on Information…
- 2006

Double loop graphs are extensions of the ring topology which are obtained by regularly adding 2 extra edges per vertex. An… (More)

Is this relevant?

1998

1998

- Thomas Zaslavsky
- 1998

We characterize the edge-signed graphs in which every 'significant' positive closed walk (or combination of walks) has even… (More)

Is this relevant?