Skip to content
DraconiticResearch
Search Sources API
189,280 studies31 sourcesUpdated 8 min ago
PreprintarXiv licencearXiv

Singular difference graphs of vector spaces of square matrices

  • Shrinath Hadimani
Open at sourcePDFDOICite

Abstract

The singular difference graph, denoted by Γ, of the vector space of square matrices over a field is a graph whose vertex set is the set of all elements of the vector space, where two distinct vertices are adjacent if and only if the difference of the corresponding matrices is singular. In this paper, we investigate fundamental graph-theoretic properties of Γ, including connectivity, diameter, regularity, the Eulerian property, independence number, clique number, and domination number. We show that Γ is a connected regular graph with diameter two. Over finite fields, we obtain an explicit formula for the degree of each vertex and characterize precisely when Γ is Eulerian. We determine the independence number and clique number and provide explicit constructions attaining these values using companion matrices of irreducible polynomials. We also construct an explicit dominating set, yielding an upper bound for the domination number.

Related

  1. Least singular values of Gaussian matrices with deterministic shifts
    Xuanang Hu, Zeyan Song, Xinglong Wu
    arXivPreprintarXiv licenceFull textProbabilityarXiv
  2. On the monotonicity of average singular values of complex Gaussian random matrices
    Jnaneshwar Baslingker, Biltu Dan
    arXivPreprintarXiv licenceFull textProbabilityarXiv
  3. Invertibility of structured perturbations of singular matrices over unital rings
    Johan Öinert
    arXivPreprintarXiv licenceFull textAlgebra & number theoryarXiv
  4. Smallest Singular Value Estimates for Nonuniform Fourier Matrices via Periodic Nonuniform Sampling
    Liang Chen, Rongrong Lin, Haizhang Zhang
    arXivPreprintCC BY 4.0Full textNumerical analysis & scientific computingarXiv
  5. A sufficient condition for the existence of solutions of singular linear-quadratic vector equations
    Rishikesh Yadav, Axel Flinth
    arXivPreprintCC BY-SA 4.0Full textNumerical analysis & scientific computingarXiv

Cite

BibTeXRIS
BibTeX
@misc{hadimani2026singular,
  title = {{Singular difference graphs of vector spaces of square matrices}},
  author = {Shrinath Hadimani},
  howpublished = {arXiv},
  year = {2026},
  month = aug,
  doi = {10.48550/arxiv.2608.28436},
  eprint = {2608.28436},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/2608.28436},
}
RIS
TY  - UNPB
TI  - Singular difference graphs of vector spaces of square matrices
AU  - Shrinath Hadimani
PY  - 2026
DA  - 2026/08/28
PB  - arXiv
DO  - 10.48550/arxiv.2608.28436
UR  - https://arxiv.org/abs/2608.28436
AB  - The singular difference graph, denoted by Γ, of the vector space of square matrices over a field is a graph whose vertex set is the set of all elements of the vector space, where two distinct vertices are adjacent if and only if the difference of the corresponding matrices is singular. In this paper, we investigate fundamental graph-theoretic properties of Γ, including connectivity, diameter, regularity, the Eulerian property, independence number, clique number, and domination number. We show that Γ is a connected regular graph with diameter two. Over finite fields, we obtain an explicit formula for the degree of each vertex and characterize precisely when Γ is Eulerian. We determine the independence number and clique number and provide explicit constructions attaining these values using companion matrices of irreducible polynomials. We also construct an explicit dominating set, yielding an upper bound for the domination number.
ER  -