For every n positive integer we show the construction of a strongly regular graph of order at most 2 which contains every graph of ordered n as a subgraph. The estimation concerning the construction is best possible.

Graph clustering methods such as spectral clustering are defined for general weighted graphs. In machine learning, however, data often is not given in form of a graph, but in terms of similarity (or distance) values between points. In this case, first a neighborhood graph is constructed using the similarities between the points and then a graph clustering algorithm is applied to this graph. In ...

Researchers often model folded protein structures as graphs with amino acids as the vertices and edges representing contacts between amino acids. The vertices in these graphs are naturally ordered in the amino acid sequence order. There are many different graph construction methods and there is no consensus about what construction to use or what the major issues are with each construction in th...

English is one of the key subjects basic education in many countries; more and students tend to learn online. This paper takes middle school texts as research object proposes a method test knowledge graph construction. Through acquiring data, preprocessing corpus, designing feature vectors, this realizes extract points from tests based on SVM model construct an graph. It important standardizati...

The aim of this paper is to brief the applications graph Theory in field medicine. In particular, biological neural networks like brain function connectivity, amygdalar network and components major depression disorder. We also discuss an interesting new application theory, that Construction.