This paper shows that, for every unit interval graph, there is a labelling which is simultaneously optimal for the following seven graph labelling problems: ban
We consider a series of benzenoid isomers obtained by attaching fragments to an n-radical. Some of their topological properties, such as the number of Kekul
A class of trust region methods tor solving linear inequality constrained problems is propo6ed in this paper. It is shown that the algorithm is of global conver
In this paper, Hamiltonian cycles and decompositions of Cayley digraphs are investigat-ed. Sufficient conditions are given for these two problems respectively.