Extremal values for ratios of distances in trees (Q1377615): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Set OpenAlex properties.
 
(5 intermediate revisions by 4 users not shown)
Property / author
 
Property / author: Curtiss Barefoot / rank
Normal rank
 
Property / author
 
Property / author: Roger Entringer / rank
Normal rank
 
Property / author
 
Property / author: László A. Székely / rank
Normal rank
 
Property / author
 
Property / author: Curtiss Barefoot / rank
 
Normal rank
Property / author
 
Property / author: Roger Entringer / rank
 
Normal rank
Property / author
 
Property / author: László A. Székely / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4871152 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4351067 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distance in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4882555 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4325295 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of the network design problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the sum of all distances in a graph or digraph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4280250 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mean distance in a tree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5606538 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2077737311 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 08:30, 30 July 2024

scientific article
Language Label Description Also known as
English
Extremal values for ratios of distances in trees
scientific article

    Statements

    Extremal values for ratios of distances in trees (English)
    0 references
    8 April 1998
    0 references
    The authors study the distance parameters of a connected graph \(G\): \[ \sigma(u):=\sum_{v\in V(G)}d(u,v) \quad\text{and}\quad \sigma(G):=\frac 12\sum_{u\in V(G)}\sigma(u), \] in the case of trees. Extremal values for the ratios \(\sigma(T)/ \sigma(v)\), \(\sigma(T)/\sigma(w)\), \(\sigma(w)/\sigma(v)\), and \(\sigma(w)/\sigma(u)\) are determined, where \(T\) is a tree of order \(n\), \(v\) is a centroid vertex of \(T\), and \(w\) and \(u\) are end vertices of \(T\).
    0 references
    0 references
    distance
    0 references
    Wiener index
    0 references
    transmission
    0 references
    status
    0 references
    tree
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers