Live briefing
Everything about Butterfly graph
Planar graph with 5 nodes and 6 edges
In the mathematical field of graph theory, the butterfly graph is a planar, undirected graph with 5 vertices and 6 edges. It can be constructed by joining 2 copies of the cycle graph C3 with a common vertex and is therefore isomorphic to the friendship graph F2. Wikipedia →
🧭 Start here: a 6-step reading path
- Read the overview: Butterfly graphA 5-minute orientation
- Skim a recent paper: Unique Studies of Butterfly GraphInfluential work since 2022
- Pick up a classic book: NotebookThe most-reprinted book on the subject
- Read the landmark paper: Poleward shifts in geographical ranges of butterfly species associated with regional warmingCited 1,874 times
- Go sideways: Diamond graphA closely related topic
- Go sideways: Friendship graphA closely related topic
📖 Definitions
No dictionary entry for this exact phrase.
🗂️ The subject at a glance
🏆 Landmark papers (most cited)
Poleward shifts in geographical ranges of butterfly species associated with regional warming
Two edge-disjoint hamiltonian cycles in the butterfly graph
Graph ranking based butterfly segmentation in ecological images
Isomorphism of degree four Cayley graph and wrapped butterfly and their optimal permutation routing algorithm
On the Total Edge Irregularity Strength of Generalized Butterfly Graph
Some new theoretical work on Half Butterfly Method for Hamiltonian circuit in complete graph
Edge pair sum labeling of butterfly graph with shell order
Efficient Historical Butterfly Counting in Large Temporal Bipartite Networks via Graph Structure-Aware Index
🆕 Influential since 2022
📚 Books worth reading
- 📕Notebookfos sette · 2018
- 📕Notebookdim ple · 2018
- 📕Notebookdim ple · 2018
- 📕Graph Paper 4x4Booksy Publishing · 2021
- 📕JournalSage Bee Press · 2018
- 📕4 X 4 Graph Paper NotebookVisionary Stationery · 2018
- 📕Half Graph 4x4 Blank PaperWeezag · 2019
Graph Paper NotepadSunny Days School Room · 2019
Ranked by number of editions on Open Library, a rough measure of how lasting a book is.
🔗 Related topics
- Diamond graph In the mathematical field of graph theory, the diamond graph is a planar, undirected graph with 4 vertices and 5 edges. It consists of a complete graph…
- Friendship graph In the mathematical field of graph theory, the friendship graph (or Dutch windmill graph or n-fan) Fn is a planar, undirected graph with 2n + 1 vertices…
- Triangle graph In the mathematical field of graph theory, the triangle graph is a planar undirected graph with 3 vertices and 3 edges, in the form of a triangle. The…
- Grötzsch graph In the mathematical field of graph theory, the Grötzsch graph is a triangle-free graph with 11 vertices, 20 edges, chromatic number 4, and crossing number…
- Robertson graph In the mathematical field of graph theory, the Robertson graph or (4,5)-cage, is a 4-regular undirected graph with 19 vertices and 38 edges named after…
- Wheel graph In graph theory, a wheel graph is a graph formed by connecting a single universal vertex to all vertices of a cycle. A wheel graph with n vertices can…
- Tietze's graph In the mathematical field of graph theory, Tietze's graph is an undirected cubic graph with 12 vertices and 18 edges. It is named after Heinrich Franz…
- Hoffman graph In the mathematical field of graph theory, the Hoffman graph is a 4-regular graph with 16 vertices and 32 edges discovered by Alan Hoffman. Published in…