Skip to search formSkip to main contentSkip to account menu

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

Related topics

Related topics

11 relations
Characteristic polynomialFriendship graphGirth (graph theory)Graceful labeling

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2018
2018
Modeling the consequences of accidents during the process of transferring waste thinner from the paint shop of an automotive industry using aloha software
Aims: During the past decade, the application of engineering and managerial techniques for designing a variety of qualitative and… 
Highly Cited
2016
Highly Cited
2016
All those Ramsey classes (Ramsey classes with closures and forbidden homomorphisms)
2015
2015
Fluid dynamic bowtie attenuators
Fluence field modulated CT allows for improvements in image quality and dose reduction. To date, only 1-D modulators have been… 
2005
2005
A proposal of butterfly-graph based stream authentication over lossy networks
In this paper, we propose a butterfly-graph based stream authentication scheme for lossy networks where the streaming packets… 
2002
2002
Endgame problems of Sim-like graph Ramsey avoidance games are PSPACE-complete
1998
1998
Cycles in the cube-connected cycles graph
1998
1998
Two problems on butterfly graphs
The cycle partition problem and the pancycle problem on butterfly graphs are studied in this paper. Suppose G=(V,E) is a graph… 
1995
1995
Hamilton cycles and paths in butterfly graphs
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… 
Review
1994
Review
1994
Methods and problems of communication in usual networks
1992
1992
Increasing the Size of a Network by a Constant Factor can Increase Performance by more than a Constant Factor
  • R. Koch
  • SIAM journal on computing (Print)
  • 1992
  • Corpus ID: 41810866
The performance of unbuffered routing algorithms for parallel computer architectures is analyzed. Unbuffered algorithms are an… 
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)