Connectivity of natural modular graphs (Q1968554)
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: Connectivity of natural modular graphs |
scientific article; zbMATH DE number 1418949
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Connectivity of natural modular graphs |
scientific article; zbMATH DE number 1418949 |
Statements
Connectivity of natural modular graphs (English)
0 references
26 November 2000
0 references
A natural modular graph \((V,E)\) is defined by two sets of integers, \(V\) and \(U\), such that any two vertices \(x,y \in V\) are adjacent if and only if \(|x-y|\in U\). The natural modular graph defined by \([n]\) and \(U\) is connected if and only if \(\text{gcd}(U) = 1\) and \(\sum U \leq (|U|-1) \cdot n + 1\).
0 references
natural modular graph
0 references
0.7494643926620483
0 references
0.7469103336334229
0 references
0.7266395688056946
0 references
