Steiner diameter, maximum degree and size of a graph (Q2032893): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3164627210 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1703.04974 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Steiner diameter of a graph with prescribed girth / rank
 
Normal rank
Property / cites work
 
Property / cites work: Upper bounds on the Steiner diameter of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Steiner diameter of 3, 4 and 5-connected maximal planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3852212 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5628165 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5422499 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Steiner distance and convexity in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Steiner distance in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rainbow trees in graphs and generalized connectivity / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Steiner \(k\)-Wiener index of graphs with given minimum degree / rank
 
Normal rank
Property / cites work
 
Property / cites work: The average Steiner distance of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the average Steiner distance of graphs with presribed properties / rank
 
Normal rank
Property / cites work
 
Property / cites work: Steiner Distance-Hereditary Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3287781 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5520566 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graphs of diameter 3 with the minimum number of edges / rank
 
Normal rank
Property / cites work
 
Property / cites work: Intersecting designs from linear programming and graphs of diameter two / rank
 
Normal rank
Property / cites work
 
Property / cites work: Steiner distance stable graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Steiner tree problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Steiner Wiener index of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Inverse problem on the Steiner Wiener index / rank
 
Normal rank
Property / cites work
 
Property / cites work: A sharp lower bound on Steiner Wiener index for trees with given diameter / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Steiner diameter of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nordhaus-Gaddum-type results for the Steiner Wiener index of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Steiner Distance in Product Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: From steiner centers to steiner medians / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4934868 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Steiner centers in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3931428 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3926609 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3216684 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the existence of N‐connected graphs with prescribed degrees (n ≧ 2) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3758864 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3487417 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4838481 / rank
 
Normal rank

Latest revision as of 23:10, 25 July 2024

scientific article
Language Label Description Also known as
English
Steiner diameter, maximum degree and size of a graph
scientific article

    Statements

    Steiner diameter, maximum degree and size of a graph (English)
    0 references
    0 references
    0 references
    0 references
    14 June 2021
    0 references
    Steiner distance
    0 references
    Steiner diameter
    0 references
    maximum degree
    0 references
    diameter
    0 references
    size
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

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