Feasibility conditions for the existence of walk-regular graphs (Q1148333): 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: Strongly regular graphs, partial geometries and partially balanced designs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Spectral conditions for the reconstructibility of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Applications of a theorem on partitioned matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5579577 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Transitive Graphs With Fewer Than Twenty Vertices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5625214 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4065581 / rank
 
Normal rank

Latest revision as of 10:16, 13 June 2024

scientific article
Language Label Description Also known as
English
Feasibility conditions for the existence of walk-regular graphs
scientific article

    Statements

    Feasibility conditions for the existence of walk-regular graphs (English)
    0 references
    1980
    0 references
    walk-regular
    0 references
    vertex-symmetric
    0 references
    distance-regular
    0 references
    eigenvector characterization
    0 references
    equitable partitions
    0 references
    0 references
    0 references

    Identifiers