Scholars Central

Research articlePublished 2018

Degree Diameter Problem on Oxide Network

Authors: Akhtar MS

Journal of Applied & Computational Mathematics

Volume 7 · Issue 1 · Pages 1–7

Ask about this article

Abstract

Select any words in the title or abstract, or press this and choose a sentence.

The degree diameter problem is the problem of finding the largest graph (in terms of number of vertices) subject to the constraints on the degree and the diameter of the graph. Beyond the degree constraint there is no restriction on the number of edges (apart from keeping the graph simple) so the resulting graph may be thought of as being embedded in the complete graph. In a generalization of this problem, the graph is considered to be embedded in some connected host graph. This article considers embedding the graph in the oxide network and provides some exact values and some upper and lower bounds for the optimal graphs.

Ask about this article

Answers come only from this article's title, abstract and keywords, each sentence pointing to where it comes from. Your question is sent to OpenAI to write the answer. Scholars Central does not store it.

Try:

Similar by topic

More from this journal

The newest in Journal of Applied & Computational Mathematics.

All its articles

Follow

New articles from what you follow go into your email digest, once you agree to alert emails.

  • JournalJournal of Applied & Computational Mathematics
  • SubjectMathematics & Statistics
  • BylineArticles whose byline prints “Akhtar MS”

For authors and organisers

Publish, present and keep up with your field

Find the right journal for your paper and submit your manuscript.

Photo: Pexels