Distance matrix polynomials of trees (Q1247981): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: On the Addressing Problem of Loop Switching / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4770421 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Spektren endlicher Grafen / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5648382 / 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: Q5663904 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On subgraph number independence in trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel concepts in graph theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5603839 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the eigenvalues of trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: The characteristic polynomial of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5676231 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the distance matrix of a directed graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4189313 / rank
 
Normal rank

Latest revision as of 22:47, 12 June 2024

scientific article
Language Label Description Also known as
English
Distance matrix polynomials of trees
scientific article

    Statements

    Identifiers