论文部分内容阅读
For a graph G, let h(G;x) = h(G) and [G]h denote the adjoint polynomial and the adjoint equivalence class of G, respectively. In this paper, a new application of [G]h is given. Making use of [G]h, we give a necessary and sufficient condition for adjoint u