<?xml version="1.0" encoding="UTF-8"?><xml><records><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>17</ref-type><contributors></contributors><titles><title><style face="normal" font="default" size="100%">An iteration method for computing the total number of spanning trees and its applications in graph theory</style></title><secondary-title><style face="normal" font="default" size="100%">Theoretical Computer Science</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2017</style></year></dates><urls><web-urls><url><style face="normal" font="default" size="100%">https://www.sciencedirect.com/science/article/pii/S030439751730779X</style></url></web-urls></urls><language><style face="normal" font="default" size="100%">eng</style></language></record></records></xml>