Live briefing
Everything about Diamond graph
Planar graph with 4 nodes and 5 edges
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 minus one edge. Wikipedia →
🧭 Start here: a 6-step reading path
- Read the overview: Diamond graphA 5-minute orientation
- Skim a recent paper: Graphenization of DiamondInfluential work since 2022
- Pick up a classic book: NotebookThe most-reprinted book on the subject
- Read the landmark paper: Embedding the diamond graph in Lp and dimension reduction in L1Cited 45 times
- Go sideways: Grötzsch graphA closely related topic
- Go sideways: Butterfly graphA closely related topic
📖 Definitions
Noun An undirected graph with four vertices and five edges.
🗂️ The subject at a glance
🏆 Landmark papers (most cited)
Embedding the diamond graph in Lp and dimension reduction in L1
Isolation of the Diamond Graph
A diamond example of an ordinal graph with no infinite paths
The vertex isoperimetric problem for the powers of the diamond graph
Multiplicative Attributes Derived from Graph Invariants for Saztec4 Diamond
Graph-theoretic and computational analysis of QSAR molecular descriptors for single chain diamond silicates
Strongly Multiplicative Labeling of Diamond Graph, Generalized Petersen Graph, and Some Other Graphs
RAINBOW CONNECTION NUMBER AND TOTAL RAINBOW CONNECTION NUMBER OF AMALGAMATION RESULTS DIAMOND GRAPH(〖Br〗_4) AND FAN GRAPH(F_3)
🆕 Influential since 2022
📚 Books worth reading
- 📕NotebookUnicorn Essentials Press · 2018
- 📕Isometric Graph Paper NotebookJaide Print Jaide Print Press · 2018
- 📕Quad Rule 5x5 Graph Paper Notebook. 7. 44 X 9. 69 120 Pages. Black White SquaresT. S. Publishing · 2018
- 📕2 : 3 Ratio Knitting Pattern Design Paper. I Commit to KnitThoa Publishing · 2019
- 📕Graph Paper WorkbookThor Wisteria · 2016
- 📕Dimetric Notebook : 120 Pages, DiamondsGraph Paper Graph Paper and More · 2016
- 📕Knitting Graph Paper Journal. 4 : 5 Ratio. 8. 5 X 11 . 120 PagesT. S. Publishing · 2018
Microsoft Powerpoint 97Gary B. Shelly · 1997
Ranked by number of editions on Open Library, a rough measure of how lasting a book is.
🔗 Related topics
- 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…
- Butterfly 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 with…
- Wagner graph In the mathematical field of graph theory, the Wagner graph is a 3-regular graph with 8 vertices and 12 edges. It is the 8-vertex Möbius ladder graph.…
- Clebsch graph In the mathematical field of graph theory, the Clebsch graph is either of two complementary graphs on 16 vertices, a 5-regular graph with 40 edges and…
- McGee graph In the mathematical field of graph theory, the McGee graph or the (3-7)-cage is a 3-regular graph with 24 vertices and 36 edges. The McGee graph is the…
- Shrikhande graph In the mathematical field of graph theory, the Shrikhande graph is a graph discovered by S. S. Shrikhande in 1959. It is a strongly regular graph with…
- Bull graph In the mathematical field of graph theory, the bull graph is a planar undirected graph with 5 vertices and 5 edges, in the form of a triangle with two…
- Chvátal graph In the mathematical field of graph theory, the Chvátal graph is an undirected graph with 12 vertices and 24 edges, discovered by Václav Chvátal in 1970…