All normalized anti-monotonic overlap graph measures are bounded
From MaRDI portal
Publication:408673
Recommendations
Cites work
- scientific article; zbMATH DE number 610968 (Why is no real title available?)
- scientific article; zbMATH DE number 1518742 (Why is no real title available?)
- scientific article; zbMATH DE number 1759681 (Why is no real title available?)
- A solution of the isomorphism problem for circulant graphs
- Clique, chromatic, and Lovász numbers of certain circulant graphs
- Exact Formulae for the Lovász Theta Function of Sparse Circulant Graphs
- Handbook of Graph Theory
- Inductive Logic Programming: Theory and methods
- Random graphs.
- Support measures for graph data
- The sandwich theorem
- The subgraph homeomorphism problem
Cited in
(3)
This page was built for publication: All normalized anti-monotonic overlap graph measures are bounded
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q408673)