In this paper,we determine their deficiencies and discuss their consecutive dege-colorings for some tricyclic graphs.

This article discusses the maximum eigenvalue,the number of vertexes,and the relationship between the vertex numbers and the number of their sides,of the k cycle graphs of length 3.

Efficient algorithm for computing the connected components of the cycle graph of two signed permutations;

Minimum degree distance of unicyclic graphs with perfect matching;

The order of two special type unicyclic graphs by their independent index;

Nth-order unicyclic graphs having the second largest and smallest independent index;