The m-matrix group inverse problem for distance-biregular graphs

HIGHLIGHTS

  • who: Aida Abiad from the Department of and Computer Science, Eindhoven University of Technology, Eindhoven, The Netherlands have published the article: The M-matrix group inverse problem for distance-biregular graphs, in the Journal: (JOURNAL)
  • what: The authors show that the two equilibrium arrays characterizing distance-biregular graphs can be expressed in terms of the mentioned equilibrium measures. As a consequence of the minimum principle the authors provide a characterization of when the group inverse of the combinatorial of a distance-biregular graph is an

SUMMARY

    One problem with the theory . . .

     

    Logo ScioWire Beta black

    If you want to have access to all the content you need to log in!

    Thanks :)

    If you don't have an account, you can create one here.

     

Scroll to Top

Add A Knowledge Base Question !

+ = Verify Human or Spambot ?