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

Butterfly graph

Known as: Bowtie-free graph, Hourglass graph, Bowtie graph 
In the mathematical field of graph theory, the butterfly graph (also called the bowtie graph and the hourglass graph) is a planar undirected graph… Expand
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2016
2016
Abstract We prove the Ramsey property for classes of ordered structures with closures and given local properties. This… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2015
2015
Fluence field modulated CT allows for improvements in image quality and dose reduction. To date, only 1-D modulators have been… Expand
Is this relevant?
2008
2008
Effective utilization of communication resources is crucial for improving performance in multiprocessor/communication systems. In… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • table 2
Is this relevant?
2005
2005
In this paper, we propose a butterfly-graph based stream authentication scheme for lossy networks where the streaming packets… Expand
  • figure 1
  • table 1
  • figure 2
  • figure 3
Is this relevant?
2003
2003
In this paper, we study the maximal length of cycle embedding in a faulty wrapped butterfly graph BFn with at most two faults in… Expand
  • table 1
  • figure 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
2002
2002
In Sim, two players compete on a complete graph of six vertices (K6). The players alternate in coloring one as yet uncolored edge… Expand
Is this relevant?
1995
1995
  • S. Wong
  • Networks
  • 1995
  • Corpus ID: 36178902
A cycle C in a graph G is a Hamilton cycle if C contains every vertex of G. Similarly, a path P in G is a Hamilton path if P… Expand
Is this relevant?
1994
1994
Abstract We show that the butterfly graph contains two edge-disjoint hamiltonian cycles by giving a recursive method of… Expand
  • figure 2
  • figure 1
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
1992
1992
We introduce a model of parallel computation that retains the ideal properties of the PRAM by using it as a sub-model, while… Expand
  • figure 1
Is this relevant?
1992
1992
The performance of unbuffered routing algorithms for parallel computer architectures is analyzed. Unbuffered algorithms are an… Expand
Is this relevant?