On determination of graph G whose bond lattice \({\mathcal L}(G)\) is modular (Q1075343)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: On determination of graph G whose bond lattice \({\mathcal L}(G)\) is modular |
scientific article; zbMATH DE number 3950590
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On determination of graph G whose bond lattice \({\mathcal L}(G)\) is modular |
scientific article; zbMATH DE number 3950590 |
Statements
On determination of graph G whose bond lattice \({\mathcal L}(G)\) is modular (English)
0 references
1985
0 references
The bond closure on a graph is defined as follows: Whenever all edges but one of a cycle belong to a subgraph then this edge belongs to the closure. The lattice determined by this closure, in the usual manner, is called the bond lattice of the graph. The author gives some simple characterization of graphs whose bond lattices are modular or distributive.
0 references
bond closure
0 references
cycle
0 references
bond lattice
0 references
0.8639837
0 references
0.8598207
0 references
0.8589369
0 references
0.8556073
0 references
0.85268164
0 references
0.85072976
0 references
