Positive Q-matrices of graphs

Research output: Contribution to journalArticlepeer-review

4 Citations (Scopus)


The Q-matrix of a connected graph G = (V,E) is Q = (q ∂(x,y))x,yεv, where ∂(x,y) is the graph distance. Let q(G] be the range of q ε (-1,1) for which the Q-matrix is strictly positive. We obtain a sufficient condition for the equality q(G̃) = q(G) where g̃ is an extension of a finite graph G by joining a square. Some concrete examples are discussed.

Original languageEnglish
Pages (from-to)81-97
Number of pages17
JournalStudia Mathematica
Issue number1
Publication statusPublished - 2007
Externally publishedYes


  • Graph
  • Markov sum
  • Positive definite kernel
  • Q-matrix

ASJC Scopus subject areas

  • Mathematics(all)

Fingerprint Dive into the research topics of 'Positive Q-matrices of graphs'. Together they form a unique fingerprint.

Cite this