Complete multipartite graphs are determined by their distance spectra (Q2442444): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Distance spectral radius of graphs with \(r\) pendent vertices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Which graphs are determined by their spectrum? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cospectral graphs and the generalized adjacency matrix / rank
 
Normal rank
Property / cites work
 
Property / cites work: Developments on spectral characterizations of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the distance matrix of a tree / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Addressing Problem for Loop Switching / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the distance spectrum of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On spectral radius of the distance matrix / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4236280 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the distance spectral radius of some graphs / rank
 
Normal rank

Revision as of 13:01, 7 July 2024

scientific article
Language Label Description Also known as
English
Complete multipartite graphs are determined by their distance spectra
scientific article

    Statements

    Complete multipartite graphs are determined by their distance spectra (English)
    0 references
    0 references
    0 references
    3 April 2014
    0 references
    distance matrix
    0 references
    complete multipartite graphs
    0 references
    cospectra
    0 references
    symmetric function
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references