Maximizing the distance between center, centroid and characteristic set of a tree (Q3439834): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Algebraic connectivity and the characteristic set of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: The perturbed laplacian matrix of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Laplacian Spectrum of a Graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Perron components and algebraic connectivity for weighted graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algebraic connectivity of weighted trees under perturbation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Characteristic vertices of weighted trees via perron values / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distances in Weighted Trees and Group Inverse of Laplacian Matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Laplacian matrices of graphs: A survey / rank
 
Normal rank

Latest revision as of 18:38, 25 June 2024

scientific article
Language Label Description Also known as
English
Maximizing the distance between center, centroid and characteristic set of a tree
scientific article

    Statements

    Identifiers