On the equivalent definition and sub-cube adjacent properties of the crossed cube;

The harmonious chromatic number of a graph G is the least number of colors which can be assigned to the vertices of G such that adjacent vertices are colored differently and any two distinct edges have different color pairs.

Relationship between the ionization energy and eigenvalue of adjacent matrix for helicene;

Isomorphism judgement of kinematic chains using adjacent matrix method;

Judgement criterion of graph connectivity based on adjacent matrix;