Formulas for Counting the Numbers of Connected Spanning Subgraphs with at Most <I>n</I>+1 Edges in a Complete Graph <I>K</I><SUB><I>n</I></SUB>
Downloads
Published
2008-09-01
Issue
Section
Papers