Characterizing \((\ell ,m)\)-walk-regular graphs (Q603112): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q4770409 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3992965 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On \(k\)-walk-regular graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The alternating and adjacency polynomials, and their relation with the spectra and diameters of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: From local adjacency polynomials to locally pseudo-distance-regular graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Problems in algebraic combinatorics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Feasibility conditions for the existence of walk-regular graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Polynomial of a Graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4873770 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4342020 / rank
 
Normal rank

Latest revision as of 10:03, 3 July 2024

scientific article
Language Label Description Also known as
English
Characterizing \((\ell ,m)\)-walk-regular graphs
scientific article

    Statements

    Characterizing \((\ell ,m)\)-walk-regular graphs (English)
    0 references
    0 references
    0 references
    0 references
    5 November 2010
    0 references
    distance-regular graph
    0 references
    walk-regular graph
    0 references
    adjacency matrix
    0 references
    spectrum
    0 references
    predistance polynomial
    0 references
    preintersection number
    0 references

    Identifiers