Pattern polynomial graphs
From MaRDI portal
Recommendations
Cites work
- A disrespectful polynomial
- Coherent algebras
- Coherent configurations. I: Ordinary representation theory
- Compact graphs and equitable partitions
- Distance-regular circulants
- Feasibility conditions for the existence of walk-regular graphs
- Graph isomorphism and theorems of Birkhoff type
- Higmanian rank-5 association schemes on 40 points
- scientific article; zbMATH DE number 1600999 (Why is no real title available?)
- scientific article; zbMATH DE number 3650737 (Why is no real title available?)
- scientific article; zbMATH DE number 3884178 (Why is no real title available?)
- scientific article; zbMATH DE number 43547 (Why is no real title available?)
- scientific article; zbMATH DE number 1890111 (Why is no real title available?)
- scientific article; zbMATH DE number 3336895 (Why is no real title available?)
- scientific article; zbMATH DE number 3352656 (Why is no real title available?)
- scientific article; zbMATH DE number 3412694 (Why is no real title available?)
- Non-singular circulant graphs and digraphs
- On construction and identification of graphs. With contributions by A. Lehman, G. M. Adelson-Velsky, V. Arlazarov, I. Faragev, A. Uskov, I. Zuev, M. Rosenfeld and B. Weisfeiler
- On distance-regularity in graphs
- On Linear Associative Algebras Corresponding to Association Schemes of Partially Balanced Designs
- On the Polynomial of a Graph
- On the polynomial of a path
- Orbit polynomial graphs of prime order
- Polynomials on graphs
- Regular two-graphs on 36 vertices
- The complexity of obtaining a distance-balanced graph
- Trivalent orbit polynomial graphs
This page was built for publication: Pattern polynomial graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6669301)