Connected graphs which are not mod sum graphs
From MaRDI portal
Proved are several lemmas and theorems, presenting some classes of graphs, which cannot be mod sum graphs. All the proofs are based on procedures of labelling vertices. Similar problems not solved yet are presented at the end of the article.
Recommendations
Cites work
- A family of sparse graphs of large sum number
- scientific article; zbMATH DE number 4130422 (Why is no real title available?)
- scientific article; zbMATH DE number 426164 (Why is no real title available?)
- scientific article; zbMATH DE number 4135996 (Why is no real title available?)
- scientific article; zbMATH DE number 4150226 (Why is no real title available?)
- scientific article; zbMATH DE number 398970 (Why is no real title available?)
- scientific article; zbMATH DE number 1279038 (Why is no real title available?)
- scientific article; zbMATH DE number 841604 (Why is no real title available?)
- scientific article; zbMATH DE number 867713 (Why is no real title available?)
- Sum graphs over all the integers
Cited in
(5)
This page was built for publication: Connected graphs which are not mod sum graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1296995)