Combinatorial Analysis in Matrices

  • Bolian Liu
  • Hong-Jian Lai
Part of the Network Theory and Applications book series (NETA, volume 3)


For a matrix A = (a ij ) ∈ M m,n , the weighted bipartite graph of A, denoted by \(\bar K\) A, has vertex set V = V 1V 2 and edge set E, where V 1 = {u 1, u 2, ... , u m } and V 2 = {v 1, v 2, ..., v n } such that u i v j E with weight a i j if and only if a ij ≠ 0.


Bipartite Graph Chordal Graph Directed Cycle Combinatorial Analysis Hadamard Matrix 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer Science+Business Media Dordrecht 2000

Authors and Affiliations

  • Bolian Liu
    • 1
  • Hong-Jian Lai
    • 2
  1. 1.Department of MathematicsSouth China Normal UniversityGuangzhouP.R. China
  2. 2.Department of MathematicsWest Virginia UniversityMorgantownUSA

Personalised recommendations