Achievable multiplicity partitions in the inverse eigenvalue problem of a graph (Q2302881): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / arXiv ID
 
Property / arXiv ID: 1907.11328 / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q126589107 / 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: Minimum number of distinct eigenvalues of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The inverse eigenvalue problem of a graph: multiplicities and minors / 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: The inertia set of the join of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graphs whose minimal rank is two / 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: The minimum rank of symmetric matrices described by a graph: a survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Smith normal form and acyclic matrices / 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: Undirected graphs of Hermitian matrices that admit only two distinct eigenvalues / 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: Graphs that allow all the eigenvalue multiplicities to be even / 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
Property / cites work
 
Property / cites work: Positive semidefinite maximum nullity and zero forcing number / rank
 
Normal rank

Latest revision as of 22:36, 21 July 2024

scientific article
Language Label Description Also known as
English
Achievable multiplicity partitions in the inverse eigenvalue problem of a graph
scientific article

    Statements

    Achievable multiplicity partitions in the inverse eigenvalue problem of a graph (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    26 February 2020
    0 references
    inverse eigenvalue problem
    0 references
    multiplicity partition
    0 references
    adjacency matrix
    0 references
    minimum rank
    0 references
    distinct eigenvalues
    0 references
    graphs
    0 references

    Identifiers