Bordering of symmetric matrices and an application to the minimum number of distinct eigenvalues for the join of graphs (Q6084878): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Minimum number of distinct eigenvalues of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ordered multiplicity inverse eigenvalue problem for graphs on six vertices / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the minimum rank of the join of graphs and decomposable graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalizations of the strong Arnold property and the minimum number of distinct eigenvalues of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Applications of analysis to the determination of the minimum number of distinct eigenvalues of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: A survey of matrix inverse eigenvalue problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Construction of acyclic matrices from spectral data / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Construction of Jacobi and Periodic Jacobi Matrices With Prescribed Spectra / rank
 
Normal rank
Property / cites work
 
Property / cites work: The inverse eigenvalue problem for Hermitian matrices whose graphs are cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Construction of matrices with a given graph and prescribed interlaced spectral data / rank
 
Normal rank
Property / cites work
 
Property / cites work: The nowhere-zero eigenbasis problem for a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Inverse Problems and Zero Forcing for Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matrix Analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Inverse eigenvalue problems and lists of multiplicities of eigenvalues for matrices whose graph is a tree: The case of generalized stars and double generalized stars. / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Nordhaus-Gaddum conjecture for the minimum number of distinct eigenvalues of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Orthogonal symmetric matrices and joins of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The maximum of the minimal multiplicity of eigenvalues of symmetric matrices whose pattern is constrained by a graph / rank
 
Normal rank

Latest revision as of 11:36, 3 August 2024

scientific article; zbMATH DE number 7761754
Language Label Description Also known as
English
Bordering of symmetric matrices and an application to the minimum number of distinct eigenvalues for the join of graphs
scientific article; zbMATH DE number 7761754

    Statements

    Bordering of symmetric matrices and an application to the minimum number of distinct eigenvalues for the join of graphs (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    6 November 2023
    0 references
    inverse eigenvalue problem
    0 references
    minimum number of distinct eigenvalues
    0 references
    borderings
    0 references
    joins of graphs
    0 references
    paths
    0 references
    cycles
    0 references
    hypercubes
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references