Connectivity of natural modular graphs

DOI10.1007/BF02667039MaRDI QIDQ1968554zbMATH OpenFDO

Authors I. É. Shulinok

Publication date 26 November 2000

Published in Cybernetics and Systems Analysis (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/BF02667039

zbMATH Keywords

natural modular graph

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Nonnumerical algorithms (68W05)

Review text

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\).

Recommendations

• Connectivity of distance graphs
• The number of labeled connected graphs modulo prime powers
• A class of graphs based on a set of moduli
• Modular intersection graphs
• scientific article; zbMATH DE number 1161290

Cited in

(5)

• Connectivity of distance graphs
• Isomorphism of regular NM-graphs of degree 4
• scientific article; zbMATH DE number 410204 (Why is no real title available?)
• A class of graphs based on a set of moduli
• A study of an undirected graph on a finite subset of natural numbers

This page was built for publication: Connectivity of natural modular graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1968554)