Abstract
The problem of counting spanning trees in linear graphs is dealt with. A quite general indirect approach, based on the analysis of the complementary graph, is followed and a new counting formula, which applies to any kind of linear non-oriented graph, is given. The paper ends with some comments and concluding remarks.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
