Degree Diameter Problem on Oxide Network
The degree diameter problem is the problem of finding the largest graph
Articles, journals and conferences in one search. An exact title, DOI or ISSN is listed first.
In the search box: "exact phrase" · -leave out · OR · prefix* · title: author: journal:
The degree diameter problem is the problem of finding the largest graph
described as a system of SiO4 tetrahedra with central silicon atom surrounded by oxygens at each vertex. In crystalline silica oxygens bridge to neighbouring tetrahedra, while in amorphous silica
For authors and organisers
Find the right journal for your paper and submit your manuscript.