OpenAlex
PricingAboutJobs
Log inGet started
Work

Maximum number of spanning trees in bipartite graphs with a given diameter

HTML PDF

Year: 2026
Type: article
Source: Chaos Solitons & Fractals
DOI: 10.1016/j.chaos.2026.119387
Authors: Shaohan Xu, Ivan Damnjanović, Kexiang Xu
Institutions: Nanjing University of Aeronautics and Astronautics, University of Primorska, University of Nis, Mathematical Institute of the Serbian Academy of Sciences and Arts
Language: English

Topic: Graph theory and applications
Subfield: Geometry and Topology
Field: Mathematics
Domain: Physical Sciences

Open Access status: green

Funders: National Natural Science Foundation of China, Government of Jiangsu Province, Science Fund of the Republic of Serbia
Award: G8803877644
OpenAlex ID: W7213255595
FWCI:
Cites:
Cited by:
Related to: 10
OpenAlex
Nonprofit
Open DataOpen Data
Open Source
Product
Search
Compare
Pricing
Repositories
Unpaywall
Unsub
Developers
API docs
Data snapshot
Status
Source code
Organization
About
Team
Testimonials
Brand
Jobs
Community
Help center
Contact
Events
Blog
Mailing list
Supporters
Legal
Privacy
Accessibility
Terms