Extremal Properties of Graphs and Eigencentrality in Trees with a Given Degree Sequence (Q3587533): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / OpenAlex ID
 
Property / OpenAlex ID: W1974864714 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Closed formulas for the numbers of small independent sets and matchings and an extremal problem for trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some New Results on the Eigenvector Centrality / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matrix Analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Towards a Theory of Scale-Free Graphs: Definition, Properties, and Implications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4276003 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Inequalities: theory of majorization and its applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extremal trees with given degree sequence for the Randić index / rank
 
Normal rank

Latest revision as of 04:42, 3 July 2024

scientific article
Language Label Description Also known as
English
Extremal Properties of Graphs and Eigencentrality in Trees with a Given Degree Sequence
scientific article

    Statements

    Extremal Properties of Graphs and Eigencentrality in Trees with a Given Degree Sequence (English)
    0 references
    0 references
    0 references
    0 references
    8 September 2010
    0 references
    0 references
    0 references
    0 references
    0 references
    bounds
    0 references
    degree sequence
    0 references
    diameter
    0 references
    eigenvector centrality
    0 references
    spectral radius
    0 references
    trees
    0 references
    0 references