The distance-regular graphs with valency \(k \geq 2\), diameter \(D \geq 3\) and \(k_{D - 1} + k_D \leq 2 k\) (Q729793): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Distance–regular graphs having the<i>M</i>-property / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cubic Distance-Regular Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Determination of the distance-regular graphs without 3-claws / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3992965 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The distance-regular graphs of valency four / rank
 
Normal rank
Property / cites work
 
Property / cites work: Geometric aspects of 2-walk-regular graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On almost distance-regular graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Spectral and Geometric Properties of k-Walk-Regular Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Shilla distance-regular graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distance-regular graphs with or at least half the valency / rank
 
Normal rank
Property / cites work
 
Property / cites work: A relationship between the diameter and the intersection number \(c _{2}\) for a distance-regular graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on distance-regular graphs with a small number of vertices compared to the valency / rank
 
Normal rank
Property / cites work
 
Property / cites work: An inequality involving the second largest and smallest eigenvalue of a distance-regular graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: The distance-regular graphs such that all of its second largest local eigenvalues are at most one / rank
 
Normal rank
Property / cites work
 
Property / cites work: 2-walk-regular graphs with a small number of vertices compared to the valency / rank
 
Normal rank

Latest revision as of 05:36, 13 July 2024

scientific article
Language Label Description Also known as
English
The distance-regular graphs with valency \(k \geq 2\), diameter \(D \geq 3\) and \(k_{D - 1} + k_D \leq 2 k\)
scientific article

    Statements

    The distance-regular graphs with valency \(k \geq 2\), diameter \(D \geq 3\) and \(k_{D - 1} + k_D \leq 2 k\) (English)
    0 references
    0 references
    22 December 2016
    0 references
    distance-regular graphs
    0 references
    antipodal distance-regular graphs
    0 references
    \(M\)-property
    0 references
    2-walk-regular graphs
    0 references

    Identifiers