Skip to content
  • Home
  • Book Bag: 0 items (Full)
    • English
    • 日本語
    • 中文(简体)
    • 中文(繁體)
    • اللغة العربية
  • About
Advanced
  • The number of spanning trees i...
  • Cite this
  • Text this
  • Print
  • Export Record
    • Export to RefWorks
    • Export to EndNoteWeb
    • Export to EndNote
  • Add to Book Bag Remove from Book Bag
  • Permanent link

The number of spanning trees in a superprism

Bibliographic Details
Published in:Discrete Mathematics Letters
Main Author: Zbigniew R. Bogdanowicz
Format: Article
Language:English
Published: Shahin Digital Publisher 2024-04-01
Subjects:
spanning trees
antiprism graph
enumeration of trees
circulant graph
prism graph
Online Access:https://www.dmlett.com/archive/v13/DML24_v13_pp66-73.pdf
  • Holdings
  • Description
  • Similar Items
  • Staff View

Internet

https://www.dmlett.com/archive/v13/DML24_v13_pp66-73.pdf

Similar Items

  • On the Minimum Number of Spanning Trees in Cubic Multigraphs
    by: Bogdanowicz Zbigniew R.
    Published: (2020-02-01)
  • Enumeration for spanning trees and forests of join graphs based on the combinatorial decomposition
    by: Sung Sik U
    Published: (2016-10-01)
  • The Spanning Tree of a Divisible Multiple Graph
    by: Alexander V. Smirnov
    Published: (2018-08-01)
  • Note: Sharp Upper and Lower Bounds on the Number of Spanning Trees in Cartesian Product of Graphs
    by: Azarija Jernej
    Published: (2013-09-01)
  • NP-completeness of the Minimum Spanning Tree Problem of a Multiple Graph of Multiplicity k ≥ 3
    by: Alexander Valeryevich Smirnov
    Published: (2021-03-01)

Search Options

  • Search History
  • Advanced Search

Find More

  • Browse the Catalog
  • Browse Alphabetically
  • Explore Channels
  • Course Reserves
  • New Items

Need Help?

  • Search Tips
  • Ask a Librarian
  • FAQs