PnPm的优美性初探

    A Preliminary Research on the Gracefulness of Graphs PnPm

    • 摘要: 首次提出了图PnPm的优美性问题,并且证明了PnPm,n>2;PnPn+1;PnPn+3;以及P2Pn,n>2的优美性。

       

      Abstract: In this paper, we pose a problem of the gracefulness of graphs PnPm, and prove the gracefulness of PnPm, where n>2; PnPn+1; PnPn+2, and P2Pn, where n>2.

       

    /

    返回文章
    返回