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

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claim: author (P16): Item:Q1642085
Set OpenAlex properties.
 
(3 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Shu-Min Zhang / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5422499 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distance in Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3470486 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Line digraph iterations and connectivity analysis of de Bruijn and Kautz graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the \(k\)-diameter of \(k\)-regular \(k\)-connected graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Steiner's problem in graphs and its implications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5654074 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Steiner tree problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3852212 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5611637 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5663877 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Diameters in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Lower Bound for the Number of Vertices of a Graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5558064 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5628165 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5520566 / 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: The Steiner diameter of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Steiner distance in graphs / 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: A Characterization of Graphs of Diameter Two / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4692391 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Steiner distance and convexity 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: 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: Distance-Hereditary Graphs, Steiner Trees, and Connected Domination / rank
 
Normal rank
Property / cites work
 
Property / cites work: Steiner distance stable graphs / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.5890/dnc.2021.09.015 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3162552413 / rank
 
Normal rank

Latest revision as of 08:59, 30 July 2024

scientific article; zbMATH DE number 7552031
Language Label Description Also known as
English
Steiner 4-diameter, maximum degree and size of a graph
scientific article; zbMATH DE number 7552031

    Statements

    Steiner 4-diameter, maximum degree and size of a graph (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    1 July 2022
    0 references
    Steiner distance of a graph
    0 references
    Steiner \(k\)-diameter
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references