Mathematical graph with at least one median per triple of vertices
Not to be confused with Modular decomposition or Modularity (networks).
A modular graph derived from a modular lattice
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 vertexm(x, y, z) that belongs to shortest paths between each pair of x, y, and z.[1]
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.[2]
It is not possible for a modular graph to contain a cycle of odd length. For, if C is a shortest odd cycle in a graph, x is a vertex of C, and yz is the edge of C farthest from x, there could be no median m(x, y, z). In this case, the only vertices on the shortest path yz are y and z themselves. Neither can belong to a shortest path from x to the other without shortcutting C and creating a shorter odd cycle. Because they have no odd cycles, every modular graph is a bipartite graph.[1]
The modular graphs contain as a special case the median graphs, in which every triple of vertices has a unique median;[1] median graphs are related to distributive lattices in the same way that modular graphs are related to modular lattices. However, the modular graphs also include other graphs such as the complete bipartite graphs where the medians are not unique: when the three vertices x, y, and z all belong to one side of the bipartition of a complete bipartite graph, every vertex on the other side is a median.[2] Every chordal bipartite graph (a class of graphs that includes the complete bipartite graphs and the bipartite distance-hereditary graphs) is modular.[1]
^ abcdModular graphs, Information System on Graph Classes and their Inclusions, retrieved 2016-09-30.
In graph theory, a branch of mathematics, the modulargraphs are undirected graphs in which every three vertices x, y, and z have at least one median...
bipartite graph is a modulargraph: every triple of vertices has a median that belongs to shortest paths between each pair of vertices. Biclique-free graph, a...
Appendix:Glossary of graph theory in Wiktionary, the free dictionary. This is a glossary of graph theory. Graph theory is the study of graphs, systems of nodes...
described the free modular lattice generated by three elements, a lattice with 28 elements (see picture). Modulargraph, a class of graphs that includes the...
In graph theory, the modular decomposition is a decomposition of a graph into subsets of vertices called modules. A module is a generalization of a connected...
module or modular in Wiktionary, the free dictionary. Module, modular and modularity may refer to the concept of modularity. They may also refer to: Modular design...
knowledge graph is a knowledge base that uses a graph-structured data model or topology to represent and operate on data. Knowledge graphs are often used...
same permutation graph; a given graph has a unique representation (up to permutation symmetry) if it is prime with respect to the modular decomposition....
In graph theory, the modular product of graphs G and H is a graph formed by combining G and H that has applications to subgraph isomorphism. It is one...
Modular programming is a software design technique that emphasizes separating the functionality of a program into independent, interchangeable modules...
communities compared to links between communities. For a weighted graph, modularity is defined as: Q = 1 2 m ∑ i = 1 N ∑ j = 1 N [ A i j − k i k j 2 m...
graph is a cycle graph, and for an infinite cyclic group with its generator the Cayley graph is a doubly infinite path graph. However, Cayley graphs can...
median graph. The only regular median graphs are the hypercubes. Every median graph is a modulargraph. The modulargraphs are a class of graphs in which...
ignored. Modular decomposition can be used to compute a power graph by using the strong modules of the modular decomposition. Modules in modular decomposition...
In mathematics, a graph partition is the reduction of a graph to a smaller graph by partitioning its set of nodes into mutually exclusive groups. Edges...
combinatorics, algebraic, differential, discrete and Euclidean geometries, graph theory, group theory, model theory, number theory, set theory, Ramsey theory...
In mathematics, random graph is the general term to refer to probability distributions over graphs. Random graphs may be described simply by a probability...
bipartite graph is a modulargraph. The chordal bipartite graphs include the complete bipartite graphs and the bipartite distance-hereditary graphs. Golumbic...
processing of graph structured data. The core of the languages consists of modulargraph rewrite rules, which are built on declarative graph pattern matching...
In graph theory, the strong perfect graph theorem is a forbidden graph characterization of the perfect graphs as being exactly the graphs that have neither...
demonstrate community structure - clusters of nodes with high modularity. Other random graph generation algorithms, such as those generated using the Erdős–Rényi...
Geometric graph theory in the broader sense is a large and amorphous subfield of graph theory, concerned with graphs defined by geometric means. In a stricter...
Global Information