scientific article; zbMATH DE number 434874
From MaRDI portal
Publication:3139726
The Pascal graph of order \(n\) is formed from the symmetric adjacency matrix whose lower triangular part is composed of the first \(n-1\) rows of Pascal's triangle with entries taken modulo 2. A parity property of binomial coefficients is employed to determine the values of several invariants (including the chromatic number and the inedependence number) for Pascal graphs. For the entire collection see [Zbl 0772.00028].
Recommendations
Cited in
(6)- A group-theoretical generalization of Pascal's triangle
- scientific article; zbMATH DE number 4160790 (Why is no real title available?)
- Pascal Triangle and Properties of Bipartite Steinhaus Graphs
- scientific article; zbMATH DE number 3968616 (Why is no real title available?)
- Spectral properties of Pascal graphs
- Symmetric Pascal matrices and related graphs
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3139726)