Sciweavers
Explore
Publications
Books
Software
Tutorials
Presentations
Lectures Notes
Datasets
Labs
Conferences
Community
Upcoming
Conferences
Top Ranked Papers
Most Viewed Conferences
Conferences by Acronym
Conferences by Subject
Conferences by Year
Tools
PDF Tools
Image Tools
Text Tools
OCR Tools
Symbol and Emoji Tools
On-screen Keyboard
Latex Math Equation to Image
Smart IPA Phonetic Keyboard
Community
Sciweavers
About
Terms of Use
Privacy Policy
Cookies
2
search results - page 1 / 1
»
Counting Spanning Trees and Other Structures in Non-constant...
Sort
relevance
views
votes
recent
update
View
thumb
title
86
click to vote
ISAAC
2004
Springer
92
views
Algorithms
»
more
ISAAC 2004
»
Counting Spanning Trees and Other Structures in Non-constant-jump Circulant Graphs
15 years 10 months ago
Download
www.cse.ust.hk
Mordecai J. Golin, Yiu-Cho Leung, Yajun Wang
claim paper
Read More »
142
Voted
WG
2004
Springer
146
views
Theoretical Computer Science
»
more
WG 2004
»
Unhooking Circulant Graphs: A Combinatorial Method for Counting Spanning Trees and Other Parameters
15 years 10 months ago
Download
www.cs.ust.hk
It has long been known that the number of spanning trees in circulant graphs with fixed jumps and n nodes satisfies a recurrence relation in n. The proof of this fact was algebra...
Mordecai J. Golin, Yiu-Cho Leung
claim paper
Read More »
« Prev
« First
page 1 / 1
Last »
Next »