Inverse problems of graph theory: graphs without triangles
From MaRDI portal
Recommendations
- Inverse problems in the theory of distance-regular graphs
- Inverse problems of graph theory: generalized quadrangles
- Inverse problems in graph theory: nets
- Inverse problems in the class of distance-regular graphs of diameter 4
- On distance-regular graph \(\Gamma\) with strongly regular graphs \(\Gamma_2\) and \(\Gamma_3\)
Cites work
- Distance-regular graphs of diameter 3 having eigenvalue -1
- Distance-regular graphs with intersection array \(\{69,56,10;1,14,60\}\), \(\{74,54,15;1,9,60\}\) and \(\{119,100,15;1,20,105\}\) do not exist
- Distance-regular Shilla graphs with b₂ = c₂
- scientific article; zbMATH DE number 43547 (Why is no real title available?)
- scientific article; zbMATH DE number 50655 (Why is no real title available?)
- Inverse problems in the theory of distance-regular graphs
- On distance-regular graph \(\Gamma\) with strongly regular graphs \(\Gamma_2\) and \(\Gamma_3\)
Cited in
(7)- Inverse problems of graph theory: generalized quadrangles
- Inverse problems in the theory of distance-regular graphs: dual 2-designs
- Inverse problems in the class of distance-regular graphs of diameter 4
- Inverse problems in the theory of distance-regular graphs
- Inverse problems in graph theory: nets
- Inverse Problems and Zero Forcing for Graphs
- Triangles in inverse NSSD graphs
This page was built for publication: Inverse problems of graph theory: graphs without triangles
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2227043)
