On properties of cell matrices (Q979296): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1016/j.amc.2010.03.032 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2064406784 / rank | |||
Normal rank |
Revision as of 02:55, 20 March 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | On properties of cell matrices |
scientific article |
Statements
On properties of cell matrices (English)
0 references
25 June 2010
0 references
The paper deals with some special classes of matrices, coming from star graphs (or claw graphs) used in graph theory and in biochemistry. A cell matrix \(D=(d_{ij})\) is associated with a vector \((\alpha _{i})\), where \( d_{ii}=0\) and \(d_{ij}=\alpha _{i}+\alpha _{j}\) for \(i\neq j\). Connecting \(k\) star graphs by inner vertices, one obtains a \(k\)-star graph. A Euclidean distance matrix (EDM) is a square \(n\) matrix having as entries the square distance of distances of \(n\) Euclidian points. A circum-Euclidean distance matrix (CEDM) imposes that the Euclidian points lie on a hypersphere. The authors prove that all cell matrices are (C)EDM, but only some special \(k\)-cell matrices are (C)EDM matrices. Some other interesting formulas concerning the calculus of a determinant of a symbolic matrix with polynomial entries are also proved.
0 references
cell matrix
0 references
star graph
0 references
determinant
0 references
eigenvalues
0 references
Euclidean distance matrix
0 references
circum-Euclidean distance matrix
0 references
symbolic matrix
0 references