摘要
首次提出了图P_nUP_m的优美性问题,并且证明了P_nUP_m,n>2;P_nUP_(n+1);P_nUP_(n+3);以及P_2UP_n,n>2的优美性。
In this paper, we pose a problem of the gracefulness of graphs Pn∪Pm, and prove the gracefulness of Pn∪Pm, where n>2; Pn∪Pn+1; Pn∪Pn+2, and P2∪Pn, where n>2.
出处
《北京工业大学学报》
CAS
CSCD
1993年第4期15-26,共12页
Journal of Beijing University of Technology