Invariant factors of graphs associated with hyperplane arrangements

Wai Chee SHIU*

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

3 Citations (Scopus)

Abstract

A matrix called Varchenko matrix associated with a hyperplane arrangement was defined by Varchenko in 1991. Matrices that we shall call q-matrices are induced from Varchenko matrices. Many researchers are interested in the invariant factors of these q-matrices. In this paper, we associate this problem with a graph theoretic model. We will discuss some general properties and give some methods for finding the invariant factors of q-matrices of certain types of graphs. The proofs are elementary. The invariant factors of complete graphs, complete bipartite graphs, even cycles, some hexagonal systems, and some polygonal trees are found.

Original languageEnglish
Pages (from-to)135-148
Number of pages14
JournalDiscrete Mathematics
Volume288
Issue number1-3
DOIs
Publication statusPublished - 28 Nov 2004

Scopus Subject Areas

  • Theoretical Computer Science
  • Discrete Mathematics and Combinatorics

User-Defined Keywords

  • Bipartite graph
  • Hyperplane arrangement
  • Invariant factors
  • Q-matrix

Fingerprint

Dive into the research topics of 'Invariant factors of graphs associated with hyperplane arrangements'. Together they form a unique fingerprint.

Cite this