FAQ

Bipartite double cover

Known as: Bipartite double 
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)
Wikipedia

Topic mentions per year

Topic mentions per year

1998-2017
0119982017

Related topics

Related topics

19 relations
Adjacency matrixBidirected graphBipartite halfCovering graph
(More)

Broader (1)

Graph operations

Related mentions per year

Related mentions per year

1936-2018
19401960198020002020
Bipartite double cover
Graph automorphism
Directed graph
Graph theory
Neighbourhood
Adjacency matrix

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2018
2018
On the construction of graphs with a planar bipartite double cover from boolean formulas and its application to counting satisfying solutions
 
Is this relevant?
2017
2017
Equivalence of Szegedy's and coined quantum walks
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)
  • figure 1
  • figure 2
  • figure 3
  • table 1
Is this relevant?
2012
2012
The permanent, graph gadgets and counting solutions for certain types of planar formulas
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)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2011
2011
Two distance-regular graphs
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
Unexpected symmetries in unstable graphs
This paper considers instability of graphs in all of its possible forms. First, four theorems (one with two interesting special… (More)
  • figure 1
  • figure 2
  • figure 4
  • figure 3
  • figure 5
Is this relevant?
2007
2007
Resolution of Irreducible Integral Flows on a Signed Graph
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
Broadcasting in Optimal Bipartite Double Loop Graphs
Double loop graphs are extensions of the ring topology which are obtained by regularly adding 2 extra edges per vertex. An… (More)
  • figure 1
  • figure 2
  • figure 4
  • figure 3
Is this relevant?
1998
1998
Signed analogs of bipartite graphs 1
We characterize the edge-signed graphs in which every 'significant' positive closed walk (or combination of walks) has even… (More)
Is this relevant?