Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

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… Expand
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2018
2018
It is explained why the term bipartite double cover should not be used to designate canonical double cover alias Kronecker cover… Expand
  • figure 1
  • figure 2
Is this relevant?
2018
2018
Abstract A bipartite digraph is said to be a half vertex transitive digraph if its automorphism acts transitively on the sets of… Expand
Is this relevant?
2015
2015
Abstract In this article, we extend several algebraic graph analysis methods to bipartite networks. In various areas of science… Expand
  • figure 1
  • table 1
  • figure 2
  • table 2
  • figure 3
Is this relevant?
2012
2012
We construct two families of distance-regular graphs, namely the subgraph of the dual polar graph of type B3(q) induced on the… Expand
Is this relevant?
2012
2012
The enumeration of independent sets in graphs with various restrictions has been a topic of much interest of late.  Let $i(G)$ be… Expand
Is this relevant?
2007
2007
A passenger compartment mounted sensor senses crashes when located outside of the crush zone in response to velocity changes. The… Expand
Is this relevant?
2007
2007
Dualizing the “extended bipartite double” construction for distance-regular graphs, we construct a new family of cometric (or Q… Expand
Is this relevant?
2006
2006
Double loop graphs are extensions of the ring topology which are obtained by regularly adding 2 extra edges per vertex. An… Expand
  • figure 1
  • figure 2
  • figure 4
  • figure 3
Is this relevant?
1998
1998
Abstract Antipodal covers of strongly regular graphs which are not necessarily distance-regular are stud- ied. The structure of… Expand
  • figure 1
  • figure 2
  • figure 3
Is this relevant?
Highly Cited
1991
Highly Cited
1991
A graph with signed arcs is oriented by directing each end of each arc in accordance with a sign-compatibility rule. We prove… Expand
Is this relevant?