The number of spanning trees in a class of double fixed-step loop networks (Q3528151): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Set OpenAlex properties.
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1002/net.20223 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W4237598401 / rank
 
Normal rank

Revision as of 21:32, 19 March 2024

scientific article
Language Label Description Also known as
English
The number of spanning trees in a class of double fixed-step loop networks
scientific article

    Statements

    The number of spanning trees in a class of double fixed-step loop networks (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    8 October 2008
    0 references
    circulant digraph
    0 references
    spanning tree
    0 references
    matrix tree theorem
    0 references
    double loop network
    0 references
    step loop network
    0 references
    step double loop network
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references