Skip to search formSkip to main contentSkip to account menu

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… 
Wikipedia (opens in a new tab)

Related topics

Related topics

19 relations
Adjacency matrixBidirected graphBipartite halfCovering graph

Broader (1)

Graph operations

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2018
2018
Not every bipartite double cover is canonical
It is explained why the term bipartite double cover should not be used to designate canonical double cover alias Kronecker cover… 
2018
2018
Connectivity of half vertex transitive digraphs
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… 
2006
2006
Some new constructions of imprimitive cometric association schemes
In a recent paper [9], the authors introduced the extended Q-bipartite double of an almost dual bipartite cometric association… 
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… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)