{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,23]],"date-time":"2024-10-23T09:52:44Z","timestamp":1729677164739,"version":"3.28.0"},"reference-count":24,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014,4]]},"DOI":"10.1109\/icmcs.2014.6911194","type":"proceedings-article","created":{"date-parts":[[2014,10,8]],"date-time":"2014-10-08T20:49:12Z","timestamp":1412801352000},"page":"1229-1234","source":"Crossref","is-referenced-by-count":4,"title":["Spanning trees in a closed chain of planar networks"],"prefix":"10.1109","author":[{"given":"Dounia","family":"Lotfi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mohamed","family":"EL Marraki","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Driss","family":"Aboutajdine","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1002\/andp.18471481202"},{"key":"ref11","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1016\/S0020-0190(00)00135-6","article-title":"On the number of spanning trees of a multi-complete\/star related graph","volume":"76","author":"kuo-liang","year":"2000","journal-title":"Information Processing Letters Elsevier"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/ICMCS.2011.5945739"},{"key":"ref13","first-page":"3147","article-title":"Formulas for the Number of Spanning Trees in a Maximal Planar Map","volume":"5","author":"modabish","year":"2011","journal-title":"Applied Mathematical Sciences"},{"key":"ref14","first-page":"2411","article-title":"Counting the Number of Spanning Trees in the Star Flower Planar Map","volume":"6","author":"modabish","year":"2012","journal-title":"Applied Mathematical Sciences"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/TCT.1971.1083273"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1016\/S0020-0190(98)00008-8"},{"key":"ref17","first-page":"65","article-title":"Synchronization is optimal in nondiago-nalizable networks","volume":"73","author":"nishikawa","year":"2006","journal-title":"Physical Review E APS"},{"key":"ref18","article-title":"Lecture Note Series on Computing","volume":"12","author":"nishizeki","year":"2004"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevLett.92.118701"},{"key":"ref4","first-page":"1","article-title":"Face Labeling of Maximal Planar Graphs","volume":"11","author":"cahit","year":"2011","journal-title":"Applied Mathematics E-Notes"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1007\/BF01788093"},{"key":"ref6","doi-asserted-by":"crossref","first-page":"584","DOI":"10.3844\/ajassp.2012.584.592","article-title":"Some Applications of Spanning Trees in Complete and Complete Bipartite Graphs","volume":"9","author":"daoud","year":"2012","journal-title":"American Journal of Applied Sciences"},{"key":"ref5","first-page":"376","article-title":"A theorem on trees","volume":"23","author":"cayley","year":"1889","journal-title":"Quart J Math"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.65.066122"},{"key":"ref7","first-page":"177","article-title":"Counting spanning trees in grid graphs","author":"desjarlais","year":"2000","journal-title":"Congressus Numerantium"},{"key":"ref2","first-page":"781","article-title":"Formulas for the number of spanning trees in a fan","volume":"2","author":"bogdanowicz","year":"2008","journal-title":"Applied Mathematical Sciences"},{"key":"ref1","doi-asserted-by":"crossref","DOI":"10.1006\/jpdc.1995.1002","article-title":"Distributed loop computer networks: A survey","volume":"24","author":"bermond","year":"1995","journal-title":"J Parallel Distrib Comput"},{"key":"ref9","first-page":"2263","article-title":"Recursive Relations for the Number of Spanning Trees","volume":"3","author":"haghighi","year":"2009","journal-title":"Applied Mathematical Sciences"},{"key":"ref20","first-page":"217","article-title":"On the Spanning Trees of Finite Graphs","volume":"94","author":"sedlacek","year":"1969","journal-title":"Cas Pestovani Mat"},{"key":"ref22","first-page":"113l","article-title":"Number of spanning trees on a lattice”, Journal of Physics A: Mathematical and General, lOP Publishing","volume":"10","author":"wu","year":"1977"},{"key":"ref21","first-page":"6445","article-title":"Network coherence in fractal graphs","author":"stacy","year":"2011","journal-title":"50th IEEE Conference on Decision and Control and European Control Conference (CDC-ECC)"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1016\/j.physa.2006.11.006"},{"key":"ref23","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1016\/S0020-0190(98)00175-6","article-title":"A formula for the number of spanning trees of a multi-star related graph","volume":"68","author":"wen-ming","year":"1998","journal-title":"Information Processing Letters Elsevier"}],"event":{"name":"2014 International Conference on Multimedia Computing and Systems (ICMCS)","start":{"date-parts":[[2014,4,14]]},"location":"Marrakech, Morocco","end":{"date-parts":[[2014,4,16]]}},"container-title":["2014 International Conference on Multimedia Computing and Systems (ICMCS)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6900112\/6911126\/06911194.pdf?arnumber=6911194","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,22]],"date-time":"2017-06-22T22:03:54Z","timestamp":1498169034000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6911194\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,4]]},"references-count":24,"URL":"https:\/\/doi.org\/10.1109\/icmcs.2014.6911194","relation":{},"subject":[],"published":{"date-parts":[[2014,4]]}}}