Skip to main content
SpringerLink
Log in

The Principle and Algorithm for Generating Incidence Matrix for Any Arbitrary Network

  • Conference paper
  • First Online:
Proceedings of The Eighth International Conference on Bio-Inspired Computing: Theories and Applications (BIC-TA), 2013

Part of the book series: Advances in Intelligent Systems and Computing ((AISC,volume 212))

  • 1114 Accesses

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 259.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 329.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Bang-Jensen J, Gutin G (2001) Digraphs. Theory, algorithms and applications, Springer monographs in mathematics. Springer, London

    Google Scholar 

  2. Severini S (2006) On the structure of the adjacency matrix of the line digraph of a regular digraph. Discrete Appl Math 154:1763–1765

    Article  MathSciNet  MATH  Google Scholar 

  3. Ferrero D (1999) Introduction to interconnection network models, Universitat Politècnica de Catalunya, Espanya. Universidad de la República, Uruguay, pp 1–57

    Google Scholar 

  4. Diestel R (2005), Graph theory, Graduate texts in mathematics, 173, 3rd edn. Springer, London. ISBN 3-540-26183-4

    Google Scholar 

  5. Boccaletti S, Latora V, Moreno Y, Chavez M, Hwang D-U (2006) Complex networks: structure and dynamics. Phys Rep 424:175–308

    Article  MathSciNet  Google Scholar 

  6. Takenaka Y (1970) Graph theoretic concepts and the incidence matrix. Inf Control 17:113–121

    Google Scholar 

  7. Yuan H (2011) Network topology for the application research of electrical control system fault propagation. Procedia Eng 15:1748–1752

    Article  Google Scholar 

  8. 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

    Article  Google Scholar 

  9. Liu L, Zhao X (2012) Application of improved adjacency matrix multiplication in distribution network flow calculation. Energy Procedia 14:983–989

    Article  Google Scholar 

  10. Newman MEJ (2003) The structure and function of complex networks. SIAM Rev 45:167–256

    Google Scholar 

  11. Estrada E, Rodríguez-Velázquez JA (2006) Subgraph centrality and clustering in complex hyper-networks. Physica A: Stat Mech Appl 364:581–594

    Article  MathSciNet  Google Scholar 

  12. Mamakani K, Myrvold W, Ruskey F (2012) Generating simple convex Venn diagrams. J Discrete Algorithms 16:270–286

    Article  MathSciNet  MATH  Google Scholar 

  13. van Douwen EK (1993) Applications of maximal topologies. Topology Appl 51(2):125–139

    Article  MathSciNet  MATH  Google Scholar 

  14. Boltyanski V (2005) Application of topology in optimization theory. Topology Applications 146–147:617–628

    Article  MathSciNet  MATH  Google Scholar 

  15. Hoffman AJ, Schieber B (2001) The edge versus path incidence matrix of series-parallel graphs and greedy packing. Discrete Appl Math 113:275–284

    Article  MathSciNet  MATH  Google Scholar 

  16. Chung FRK (1995) Eigenvalues of graphs. In: Proceedings of the international congress of mathematics, 1994. Birkhauser Verlag, New York, pp 1333–1342

    Google Scholar 

  17. Griffith DA (2004) Extreme eigenfunctions of adjacency matrices for planar graphs employed in spatial analyses. Linear Algebra Appl 388:201–219

    Google Scholar 

  18. Thompson JG (1997) Incidence matrices of finite projective planes and their eigenvalues. J Algebra 191(1):265–278

    Article  MathSciNet  MATH  Google Scholar 

  19. 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

    Article  MathSciNet  MATH  Google Scholar 

  20. Haemers WH, Omidi GR (2011) Universal adjacency matrices with two eigenvalues. Linear Algebra Appl 435(10):2520–2529

    Article  MathSciNet  MATH  Google Scholar 

  21. 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

    Article  Google Scholar 

  22. Ghosh S, Podder M, Sen MK (2010) Adjacency matrices of probe interval graphs. Discrete Appl Math 158:2004–2013

    Article  MathSciNet  MATH  Google Scholar 

Download references

Acknowledgments

This work was supported by National Natural Science Foundation of China (No. 51174190).

Author information

Authors and Affiliations

  1. Institute of Rock and Soil Mechanics, Chinese Academy of Sciences, Wuhan, 430071, Hubei, China

    Wei Zhang, Chao-bo Lu & Hai-bo Li

Authors
  1. Wei Zhang
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Chao-bo Lu
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Hai-bo Li
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Wei Zhang .

Editor information

Editors and Affiliations

  1. School of Science, Anhui University of Science & Technology, Huainan, China

    Zhixiang Yin

  2. Huazhong University of Science and Technology, Wuhan, China

    Linqiang Pan

  3. Anhui University of Science & Technology, Huainan, China

    Xianwen Fang

Rights and permissions

Reprints 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)

Publish with us

Policies and ethics

Search

Navigation