The number of spanning trees of the regular networks

DOI10.1080/00207168808803618zbMath0683.05016OpenAlexW2135258057MaRDI QIDQ4732481

No author found.

Publication date: 1988

Published in: International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207168808803618

zbMATH Keywords

number of spanning treesregular networks

Mathematics Subject Classification ID

Trees (05C05) Enumeration in graph theory (05C30)

Related Items (6)

The number of spanning trees of the generalized Boolean \(n\)-cube network ⋮ On super connectivity of Cartesian product graphs ⋮ The number of spanning trees of the Cartesian product of regular graphs ⋮ On super edge-connectivity of product graphs ⋮ The number of spanning trees of the generalized hypercube network ⋮ On connectivity of the cartesian product of two graphs

Cites Work

• Unnamed Item
• On the number of spanning trees of circulant graphs
• A Regular Fault-Tolerant Architecture for Interconnection Networks
• Fault Diagnosis in a Boolean n Cube Array of Microprocessors
• Reliable circuits using less reliable relays

This page was built for publication: The number of spanning trees of the regular networks