Walks and regular integral graphs
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 1877028
- scientific article; zbMATH DE number 3991533
- The nonregular, bipartite, integral graphs with maximum degree 4. I: Basic properties
- scientific article; zbMATH DE number 2033399
- More on non-regular bipartite integral graphs with maximum degree 4 not having \(\pm1\) as eigenvalues
Cites work
- scientific article; zbMATH DE number 3991533 (Why is no real title available?)
- scientific article; zbMATH DE number 3477222 (Why is no real title available?)
- scientific article; zbMATH DE number 3492726 (Why is no real title available?)
- scientific article; zbMATH DE number 3556146 (Why is no real title available?)
- scientific article; zbMATH DE number 3585485 (Why is no real title available?)
- scientific article; zbMATH DE number 1029224 (Why is no real title available?)
- scientific article; zbMATH DE number 2033399 (Why is no real title available?)
- scientific article; zbMATH DE number 1868922 (Why is no real title available?)
- scientific article; zbMATH DE number 1877028 (Why is no real title available?)
- scientific article; zbMATH DE number 1877038 (Why is no real title available?)
- 4-regular integral graphs avoiding ±3 in the spectrum
- A survey on integral graphs
- Graph theoretical results obtained by the support of the expert system ``Graph -- an extended survey
- The nonregular, bipartite, integral graphs with maximum degree 4. I: Basic properties
- Which non-regular bipartite integral graphs with maximum degree four do not have 1 as eigenvalues?
Cited in
(11)- Green walks in a hypergraph
- Nonregular graphs with a regular number of walks
- Spectral moments of regular graphs in terms of subgraph counts
- Two spectral characterizations of regular, bipartite graphs with five eigenvalues
- Graphs with integral spectrum
- Integral trees with diameter four
- Counting matchings and tree-like walks in regular graphs
- Graphs for small multiprocessor interconnection networks
- Integral regular net-balanced signed graphs with vertex degree at most four
- Integral graphs obtained by dual Seidel switching
- A survey of automated conjectures in spectral graph theory
This page was built for publication: Walks and regular integral graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q876312)