{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T10:43:01Z","timestamp":1740134581861,"version":"3.37.3"},"reference-count":13,"publisher":"Wiley","license":[{"start":{"date-parts":[[2013,1,1]],"date-time":"2013-01-01T00:00:00Z","timestamp":1356998400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/3.0\/"}],"funder":[{"DOI":"10.13039\/501100002403","name":"Taibah University","doi-asserted-by":"publisher","award":["3070\/1434"],"award-info":[{"award-number":["3070\/1434"]}],"id":[{"id":"10.13039\/501100002403","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Applied Mathematics"],"published-print":{"date-parts":[[2013]]},"abstract":"<jats:p>The number of spanning trees in graphs (networks) is an important invariant; it is also an important measure of reliability of a network. In this paper, we derive simple formulas of the complexity, number of spanning trees, of products of some complete and complete bipartite graphs such as cartesian product, normal product, composition product, tensor product, and symmetric product, using linear algebra and matrix analysis techniques.<\/jats:p>","DOI":"10.1155\/2013\/673270","type":"journal-article","created":{"date-parts":[[2013,11,27]],"date-time":"2013-11-27T18:02:15Z","timestamp":1385575335000},"page":"1-25","source":"Crossref","is-referenced-by-count":6,"title":["Complexity of Products of Some Complete and Complete Bipartite Graphs"],"prefix":"10.1155","volume":"2013","author":[{"given":"S. N.","family":"Daoud","sequence":"first","affiliation":[{"name":"Department of of Mathematics, Faculty of Science, Taibah University, Al Madinah 344, Saudi Arabia"},{"name":"Department of Mathematics, Faculty of Science, El-Menoufia University, Shebeen El-Kom, Egypt"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"311","reference":[{"key":"9","first-page":"497","volume":"72","year":"1847","journal-title":"Annual Review of Physical Chemistry"},{"key":"8","doi-asserted-by":"publisher","DOI":"10.1016\/0095-8956(74)90065-3"},{"key":"4","first-page":"276","volume":"23","year":"1889","journal-title":"Quarterly Journal of Mathematics"},{"key":"5","first-page":"50","volume":"38","year":"2003","journal-title":"Bulletin of the Institute of Combinatorics and its Applications"},{"key":"11","first-page":"10","volume":"9","year":"2009","journal-title":"Applied Mathematics E-Notes"},{"first-page":"111","volume-title":"Lucas numbers in graph theory","year":"1970","key":"12"},{"first-page":"387","volume-title":"On the skeleton of a graph or digraph","year":"1970","key":"13"},{"key":"2","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1080\/00207168708803568","volume":"21","year":"1987","journal-title":"International Journal of Computer Mathematics"},{"key":"3","doi-asserted-by":"publisher","DOI":"10.1007\/BF01788093"},{"key":"6","first-page":"68","volume":"4","year":"2013","journal-title":"International Journal of Mathematical Combinatorics"},{"year":"1964","key":"10"},{"year":"1987","key":"7"},{"key":"1","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4419-8505-7"}],"container-title":["Journal of Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/downloads.hindawi.com\/journals\/jam\/2013\/673270.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/downloads.hindawi.com\/journals\/jam\/2013\/673270.xml","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/downloads.hindawi.com\/journals\/jam\/2013\/673270.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,21]],"date-time":"2017-06-21T23:17:45Z","timestamp":1498087065000},"score":1,"resource":{"primary":{"URL":"http:\/\/www.hindawi.com\/journals\/jam\/2013\/673270\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"references-count":13,"alternative-id":["673270","673270"],"URL":"https:\/\/doi.org\/10.1155\/2013\/673270","relation":{},"ISSN":["1110-757X","1687-0042"],"issn-type":[{"type":"print","value":"1110-757X"},{"type":"electronic","value":"1687-0042"}],"subject":[],"published":{"date-parts":[[2013]]}}}