Abstract
Let the vertices of two disjoint, equal length cycles be labelled in one cycle and in the other. The prism Pn is defined as the graph obtained by adding to the disjoint cycles all edges of the form ViWi The prism is sometimes denoted by K 2×Cn . In this work we derive the following simple formula for t(Pn ) the number of spanning trees in .
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
