On mean distance and girth (Q608268): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Recherche à voisinage variable de graphes extrémaux 26. Nouveaux résultats sur la maille / rank
 
Normal rank
Property / cites work
 
Property / cites work: Using minimum degree to bound average distance / rank
 
Normal rank
Property / cites work
 
Property / cites work: On mean distance and girth / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5615282 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Average distance in graphs with removed elements / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3947691 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Variable neighborhood search for extremal graphs. I: The AutoGraphiX system / rank
 
Normal rank
Property / cites work
 
Property / cites work: The average distance and the independence number / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5488348 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Average distance and independence number / rank
 
Normal rank
Property / cites work
 
Property / cites work: Average distance, minimum degree, and spanning trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2712522 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mean distance in a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4351067 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Edge-vulnerability and mean distance / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3199438 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On mean distance in certain classes of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mean distance and minimum degree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Eigenvalues, diameter, and mean distance in graphs / 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: Bounding the diameter and the mean distance of a graph from its eigenvalues: Laplacian versus adjacency matrix methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3772252 / rank
 
Normal rank

Latest revision as of 13:05, 3 July 2024

scientific article
Language Label Description Also known as
English
On mean distance and girth
scientific article

    Statements

    On mean distance and girth (English)
    0 references
    0 references
    0 references
    25 November 2010
    0 references
    0 references
    mean distance
    0 references
    girth
    0 references
    0 references