The distance signatures of the incidence graphs of affine resolvable designs

DOI10.1016/J.LAA.2015.12.003zbMATH Open1329.05194arXiv1604.08922OpenAlexW2216746770MaRDI QIDQ905703FDOQ905703

Authors: Jian-Min Ma 

Publication date: 28 January 2016

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

Abstract: In this note, we determined the distance signatures of the incidence matrices of affine resolvable designs. This proves a conjecture by Kohei Yamada.

Full work available at URL: https://arxiv.org/abs/1604.08922

zbMATH Keywords

signatureaffine divisible designdistance-matrix

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Eigenvalues, singular values, and eigenvectors (15A18) Distance in graphs (05C12)

Cites Work

• Distance spectra of graphs: a survey
• A short note on a short remark of Graham and Lovász
• Distance matrix polynomials of trees
• Title not available (Why is that?)
• Title not available (Why is that?)
• The inertia of distance matrices of some graphs
• The inertia and energy of distance matrices of complete \(k\)-partite graphs

Cited In (2)

• Mutual incidence matrix of two balanced incomplete block designs
• On the 2-\(Y\)-homogeneous condition of the incidence graphs of 2-designs

This page was built for publication: The distance signatures of the incidence graphs of affine resolvable designs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q905703)