@article{dmtcs:364,
    title      = {On the number of spanning trees of K_n^m \#x00B1 G graphs},
    author     = {Stavros D. Nikolopoulos and Charis Papadopoulos},
    url        = {https://dmtcs.episciences.org/364},
    doi        = {10.46298/dmtcs.364},
    journal    = {Discrete Mathematics \& Theoretical Computer Science},
    issn       = {1365-8050},
    volume     = {Vol. 8},
    eid        = 1,
    year       = {2006},
    month      = {Jan},
    keywords   = {multigraphs, Kirchhoff matrix tree theorem, complement spanning tree matrix, spanning trees, Kn-complements, multigraphs., [INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM]},
    language   = {English},
}