Live briefing
Everything about Modular graph
Mathematical graph with at least one median per triple of vertices
In graph theory, a branch of mathematics, the modular graphs are undirected graphs in which every three vertices x, y, and z have at least one median vertex m(x, y, z) that belongs to shortest paths between each pair of x, y, and z. Their name comes from the fact that a finite lattice is a modular lattice if and only if its Hasse diagram is a modular graph. Wikipedia →
🧭 Start here: a 6-step reading path
- Read the overview: Modular graphA 5-minute orientation
- Skim a recent paper: BIM-based graph data model for automatic generative design of modular buildingsInfluential work since 2022
- Pick up a classic book: Four faces of number theoryThe most-reprinted book on the subject
- Read the landmark paper: Modular graph functionsCited 86 times
- Go sideways: Glossary of graph theoryA closely related topic
- Go sideways: Median graphA closely related topic
📖 Definitions
No dictionary entry for this exact phrase.
🗂️ The subject at a glance
No outline available.
🏆 Landmark papers (most cited)
Modular graph functions
Modular Graph Transformer Networks for Multi-Label Image Classification
Identities between modular graph forms
Proving relations between modular graph functions
Hierarchy of modular graph identities
Modular bond‐graph modelling and analysis of biomolecular systems
Knowledge graph-enabled adaptive work packaging approach in modular construction
MoMI-G: modular multi-scale integrated genome graph browser
🆕 Influential since 2022
BIM-based graph data model for automatic generative design of modular buildings
Intelligent floor plan design of modular high-rise residential building based on graph-constrained generative adversarial networks
Modular Meta-Learning for Power Control via Random Edge Graph Neural Networks
Evolving brain network dynamics in early childhood: Insights from modular graph metrics
An edge-weighted graph triumvirate to represent modular building layouts
📚 Books worth reading
- 📕Four faces of number theoryKathrin Bringmann · 2015
- 📕Topics in Hyperplane ArrangementsMarcelo Aguiar, Swapneel Mahajan · 2017
Ranked by number of editions on Open Library, a rough measure of how lasting a book is.
🔗 Related topics
- Glossary of graph theory Look up Appendix:Glossary of graph theory in Wiktionary, the free dictionary. This is a glossary of graph theory. Graph theory is the study of graphs,…
- Median graph In graph theory, a division of mathematics, a median graph is an undirected graph in which every three vertices a, b, and c have a unique median: a vertex…
- Complete bipartite graph In the mathematical field of graph theory, a complete bipartite graph or biclique is a special kind of bipartite graph where every vertex of the first…
- Bipartite graph In the mathematical field of graph theory, a bipartite graph (or bigraph) is a graph whose vertices can be divided into two disjoint and independent sets…
- Simplex graph In graph theory, a branch of mathematics, the simplex graph κ(G) of an undirected graph G is itself a graph, with one node for each clique (a set of mutually…
- Median algebra In mathematics, a median algebra is a set with a ternary operation ⟨ x , y , z ⟩ {\displaystyle \langle x,y,z\rangle } satisfying a set of axioms which…
- Geodetic graph In graph theory, a geodetic graph is an undirected graph such that there exists a unique (unweighted) shortest path between each two vertices. Geodetic…
- Zarankiewicz problem Unsolved problem in mathematics What is the largest possible number of edges in a bipartite graph that has a given number of vertices and has no complete…