Abstract
In this paper, a new principle and algorithm for obtaining the incidence matrix for any arbitrary network which were represented by nodes and segments while we have already known the endpoints of each line segments in 2D space were introduced. In addition, a calculated procedure was compiled by C++ language and two extra examples were calculated. The results shown that the principal and algorithm we stated were right for auto-generating of the incidence matrix for any arbitrary network.
Keywords
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsReferences
Bang-Jensen J, Gutin G (2001) Digraphs. Theory, algorithms and applications, Springer monographs in mathematics. Springer, London
Severini S (2006) On the structure of the adjacency matrix of the line digraph of a regular digraph. Discrete Appl Math 154:1763–1765
Ferrero D (1999) Introduction to interconnection network models, Universitat Politècnica de Catalunya, Espanya. Universidad de la República, Uruguay, pp 1–57
Diestel R (2005), Graph theory, Graduate texts in mathematics, 173, 3rd edn. Springer, London. ISBN 3-540-26183-4
Boccaletti S, Latora V, Moreno Y, Chavez M, Hwang D-U (2006) Complex networks: structure and dynamics. Phys Rep 424:175–308
Takenaka Y (1970) Graph theoretic concepts and the incidence matrix. Inf Control 17:113–121
Yuan H (2011) Network topology for the application research of electrical control system fault propagation. Procedia Eng 15:1748–1752
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–162
Liu L, Zhao X (2012) Application of improved adjacency matrix multiplication in distribution network flow calculation. Energy Procedia 14:983–989
Newman MEJ (2003) The structure and function of complex networks. SIAM Rev 45:167–256
Estrada E, Rodríguez-Velázquez JA (2006) Subgraph centrality and clustering in complex hyper-networks. Physica A: Stat Mech Appl 364:581–594
Mamakani K, Myrvold W, Ruskey F (2012) Generating simple convex Venn diagrams. J Discrete Algorithms 16:270–286
van Douwen EK (1993) Applications of maximal topologies. Topology Appl 51(2):125–139
Boltyanski V (2005) Application of topology in optimization theory. Topology Applications 146–147:617–628
Hoffman AJ, Schieber B (2001) The edge versus path incidence matrix of series-parallel graphs and greedy packing. Discrete Appl Math 113:275–284
Chung FRK (1995) Eigenvalues of graphs. In: Proceedings of the international congress of mathematics, 1994. Birkhauser Verlag, New York, pp 1333–1342
Griffith DA (2004) Extreme eigenfunctions of adjacency matrices for planar graphs employed in spatial analyses. Linear Algebra Appl 388:201–219
Thompson JG (1997) Incidence matrices of finite projective planes and their eigenvalues. J Algebra 191(1):265–278
Ilmonen P, Haukkanen P, Merikoski JK (2008) On eigenvalues of meet and join matrices associated with incidence functions. Linear Algebra Appl 429(4):859–874
Haemers WH, Omidi GR (2011) Universal adjacency matrices with two eigenvalues. Linear Algebra Appl 435(10):2520–2529
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–51
Ghosh S, Podder M, Sen MK (2010) Adjacency matrices of probe interval graphs. Discrete Appl Math 158:2004–2013
Acknowledgments
This work was supported by National Natural Science Foundation of China (No. 51174190).
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Zhang, W., Lu, Cb., Li, Hb. (2013). The Principle and Algorithm for Generating Incidence Matrix for Any Arbitrary Network. In: Yin, Z., Pan, L., Fang, X. (eds) Proceedings of The Eighth International Conference on Bio-Inspired Computing: Theories and Applications (BIC-TA), 2013. Advances in Intelligent Systems and Computing, vol 212. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-37502-6_39
Download citation
DOI: https://doi.org/10.1007/978-3-642-37502-6_39
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-37501-9
Online ISBN: 978-3-642-37502-6
eBook Packages: EngineeringEngineering (R0)