Matrices and Graphs

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

Abstract

For a digraph D with vertices V (D) = {v 1,v 2, ...,v n }, let m(v i , v j ) denote the number of arcs in D oriented from v i to v j . The adjacency matrix of D is an n by n matrix A(D) = (a ij ), given by
$$ {a_{ij}} = m({v_i},{v_j})$$

Keywords

Adjacency Matrix Connected Graph Spectral Radius Incidence Matrix Permutation 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.

Preview

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