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… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

1990-2017
02419902017

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2017
2017
Domination Theory is an important branch of Graph Theory that has wide range of applications to various branches of Science and… (More)
  • figure 7.10
  • figure 3
Is this relevant?
2014
2014
Butterfly graphs are very important structures in computer architecture and communication techniques. Total Domination is an… (More)
  • figure 1
  • figure 2
  • figure 3
Is this relevant?
2009
2009
This paper presents the generalized butterfly graph (GBG) and its application to video stream authentication. Compared with the… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2008
2008
This paper shows how Rate-Distortion-Authentication (R-D-A) optimized streaming may be performed with the Generalized Butterfly… (More)
  • figure 1
  • figure 2
  • figure 4
  • figure 5
  • figure 6
Is this relevant?
2007
2007
This paper proposes a stream authentication method based on the generalized butterfly graph (GBG) framework. Compared with the… (More)
  • figure 2
  • figure 3
  • figure 4
  • figure 5
  • figure 6
Is this relevant?
Highly Cited
2007
Highly Cited
2007
The problem of network coding with two simple unicast sessions is considered for general directed acyclic graphs. An explicit… (More)
  • figure 1
  • figure 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… (More)
  • figure 1
  • table 1
  • figure 2
  • figure 3
Is this relevant?
2005
2005
In this paper, we propose a butterfly−graph based stream authentication scheme for lossy networks where the streaming packets… (More)
Is this relevant?
1994
1994
We show that the butterfly graph contains two edge-disjoint hamiltonian cycles by giving a recursive method of construction of… (More)
  • figure 2
  • figure 1
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
1990
1990
We present optimal embeddings of three genres of butterfly-like graphs in the (boolean) hypercube; each embedding is specified… (More)
Is this relevant?