{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T14:11:40Z","timestamp":1742911900392,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642375019"},{"type":"electronic","value":"9783642375026"}],"license":[{"start":{"date-parts":[[2013,1,1]],"date-time":"2013-01-01T00:00:00Z","timestamp":1356998400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-37502-6_39","type":"book-chapter","created":{"date-parts":[[2013,5,7]],"date-time":"2013-05-07T08:25:55Z","timestamp":1367915155000},"page":"317-328","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["The Principle and Algorithm for Generating Incidence Matrix for Any Arbitrary Network"],"prefix":"10.1007","author":[{"given":"Wei","family":"Zhang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chao-bo","family":"Lu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hai-bo","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2013,5,8]]},"reference":[{"key":"39_CR1","unstructured":"Bang-Jensen J, Gutin G (2001) Digraphs. Theory, algorithms and applications, Springer monographs in mathematics. Springer, London"},{"key":"39_CR2","doi-asserted-by":"publisher","first-page":"1763","DOI":"10.1016\/j.dam.2006.03.008","volume":"154","author":"S Severini","year":"2006","unstructured":"Severini S (2006) On the structure of the adjacency matrix of the line digraph of a regular digraph. Discrete Appl Math 154:1763\u20131765","journal-title":"Discrete Appl Math"},{"key":"39_CR3","unstructured":"Ferrero D (1999) Introduction to interconnection network models, Universitat Polit\u00e8cnica de Catalunya, Espanya. Universidad de la Rep\u00fablica, Uruguay, pp 1\u201357"},{"key":"39_CR4","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1007\/978-3-642-14279-6_7","volume-title":"Graph Theory","author":"Reinhard Diestel","year":"2005","unstructured":"Diestel R (2005), Graph theory, Graduate texts in mathematics, 173, 3rd edn. Springer, London. ISBN 3-540-26183-4"},{"key":"39_CR5","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1016\/j.physrep.2005.10.009","volume":"424","author":"S Boccaletti","year":"2006","unstructured":"Boccaletti S, Latora V, Moreno Y, Chavez M, Hwang D-U (2006) Complex networks: structure and dynamics. Phys Rep 424:175\u2013308","journal-title":"Phys Rep"},{"issue":"2","key":"39_CR6","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1016\/S0019-9958(70)90501-2","volume":"17","author":"Yoshiko Takenaka","year":"1970","unstructured":"Takenaka Y (1970) Graph theoretic concepts and the incidence matrix. Inf Control 17:113\u2013121","journal-title":"Information and Control"},{"key":"39_CR7","doi-asserted-by":"publisher","first-page":"1748","DOI":"10.1016\/j.proeng.2011.08.326","volume":"15","author":"H Yuan","year":"2011","unstructured":"Yuan H (2011) Network topology for the application research of electrical control system fault propagation. Procedia Eng 15:1748\u20131752","journal-title":"Procedia Eng"},{"issue":"3","key":"39_CR8","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1016\/S0378-7796(01)00083-9","volume":"57","author":"G Liu","year":"2001","unstructured":"Liu G, Sasaki H, Yorino N (2001) Application of network topology to long range composite expansion planning of generation and transmission lines. Electr Power Syst Res 57(3):157\u2013162","journal-title":"Electr Power Syst Res"},{"key":"39_CR9","doi-asserted-by":"publisher","first-page":"983","DOI":"10.1016\/j.egypro.2011.12.1043","volume":"14","author":"L Liu","year":"2012","unstructured":"Liu L, Zhao X (2012) Application of improved adjacency matrix multiplication in distribution network flow calculation. Energy Procedia 14:983\u2013989","journal-title":"Energy Procedia"},{"issue":"2","key":"39_CR10","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1137\/S003614450342480","volume":"45","author":"M. E. J. Newman","year":"2003","unstructured":"Newman MEJ (2003) The structure and function of complex networks. SIAM Rev 45:167\u2013256","journal-title":"SIAM Review"},{"key":"39_CR11","doi-asserted-by":"publisher","first-page":"581","DOI":"10.1016\/j.physa.2005.12.002","volume":"364","author":"E Estrada","year":"2006","unstructured":"Estrada E, Rodr\u00edguez-Vel\u00e1zquez JA (2006) Subgraph centrality and clustering in complex hyper-networks. Physica A: Stat Mech Appl 364:581\u2013594","journal-title":"Physica A: Stat Mech Appl"},{"key":"39_CR12","doi-asserted-by":"publisher","first-page":"270","DOI":"10.1016\/j.jda.2012.04.013","volume":"16","author":"K Mamakani","year":"2012","unstructured":"Mamakani K, Myrvold W, Ruskey F (2012) Generating simple convex Venn diagrams. J Discrete Algorithms 16:270\u2013286","journal-title":"J Discrete Algorithms"},{"issue":"2","key":"39_CR13","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1016\/0166-8641(93)90145-4","volume":"51","author":"EK van Douwen","year":"1993","unstructured":"van Douwen EK (1993) Applications of maximal topologies. Topology Appl 51(2):125\u2013139","journal-title":"Topology Appl"},{"key":"39_CR14","doi-asserted-by":"publisher","first-page":"617","DOI":"10.1016\/j.topol.2004.05.013","volume":"146\u2013147","author":"V Boltyanski","year":"2005","unstructured":"Boltyanski V (2005) Application of topology in optimization theory. Topology Applications 146\u2013147:617\u2013628","journal-title":"Topology Applications"},{"key":"39_CR15","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1016\/S0166-218X(00)00294-8","volume":"113","author":"AJ Hoffman","year":"2001","unstructured":"Hoffman AJ, Schieber B (2001) The edge versus path incidence matrix of series-parallel graphs and greedy packing. Discrete Appl Math 113:275\u2013284","journal-title":"Discrete Appl Math"},{"key":"39_CR16","doi-asserted-by":"crossref","first-page":"1333","DOI":"10.1007\/978-3-0348-9078-6_128","volume-title":"Proceedings of the International Congress of Mathematicians","author":"Fan R. K. Chung","year":"1995","unstructured":"Chung FRK (1995) Eigenvalues of graphs. In: Proceedings of the international congress of mathematics, 1994. Birkhauser Verlag, New York, pp 1333\u20131342"},{"key":"39_CR17","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1016\/S0024-3795(03)00368-9","volume":"388","author":"Daniel A Griffith","year":"2004","unstructured":"Griffith DA (2004) Extreme eigenfunctions of adjacency matrices for planar graphs employed in spatial analyses. Linear Algebra Appl 388:201\u2013219","journal-title":"Linear Algebra and its Applications"},{"issue":"1","key":"39_CR18","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1006\/jabr.1996.6919","volume":"191","author":"JG Thompson","year":"1997","unstructured":"Thompson JG (1997) Incidence matrices of finite projective planes and their eigenvalues. J Algebra 191(1):265\u2013278","journal-title":"J Algebra"},{"issue":"4","key":"39_CR19","doi-asserted-by":"publisher","first-page":"859","DOI":"10.1016\/j.laa.2008.04.014","volume":"429","author":"P Ilmonen","year":"2008","unstructured":"Ilmonen P, Haukkanen P, Merikoski JK (2008) On eigenvalues of meet and join matrices associated with incidence functions. Linear Algebra Appl 429(4):859\u2013874","journal-title":"Linear Algebra Appl"},{"issue":"10","key":"39_CR20","doi-asserted-by":"publisher","first-page":"2520","DOI":"10.1016\/j.laa.2011.02.023","volume":"435","author":"WH Haemers","year":"2011","unstructured":"Haemers WH, Omidi GR (2011) Universal adjacency matrices with two eigenvalues. Linear Algebra Appl 435(10):2520\u20132529","journal-title":"Linear Algebra Appl"},{"key":"39_CR21","doi-asserted-by":"publisher","first-page":"40","DOI":"10.1016\/j.advengsoft.2012.02.013","volume":"48","author":"K Ying","year":"2012","unstructured":"Ying K, Chu J, Qu J, Luo Y (2012) A model and topological analysis procedures for a pipeline network of variable connectivity. Adv Eng Softw 48:40\u201351","journal-title":"Adv Eng Softw"},{"key":"39_CR22","doi-asserted-by":"publisher","first-page":"2004","DOI":"10.1016\/j.dam.2010.08.018","volume":"158","author":"S Ghosh","year":"2010","unstructured":"Ghosh S, Podder M, Sen MK (2010) Adjacency matrices of probe interval graphs. Discrete Appl Math 158:2004\u20132013","journal-title":"Discrete Appl Math"}],"container-title":["Advances in Intelligent Systems and Computing","Proceedings of The Eighth International Conference on Bio-Inspired Computing: Theories and Applications (BIC-TA), 2013"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-37502-6_39","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,20]],"date-time":"2023-01-20T07:19:14Z","timestamp":1674199154000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-642-37502-6_39"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642375019","9783642375026"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-37502-6_39","relation":{},"ISSN":["2194-5357","2194-5365"],"issn-type":[{"type":"print","value":"2194-5357"},{"type":"electronic","value":"2194-5365"}],"subject":[],"published":{"date-parts":[[2013]]},"assertion":[{"value":"8 May 2013","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}