On problems and conjectures on adjointly equivalent graphs (Q556853): Difference between revisions

The authors solve the problem of \textit{F. M. Dong, K. L. Teo, C. H. C. Little} and \textit{M. D. Hendy} [Discrete Math. 258, 303--321 (2002; Zbl 1010.05024)] to determine adjoint closures of two special classes of graphs, and consequently, disprove their conjectures. They also give necessary and sufficient conditions for two graphs to be adjointly equivalent, provided both graphs have their minimum real root of adjoint polynomial larger than or equal to \(-4\).