Pages that link to "Item:Q2417996"
From MaRDI portal
The following pages link to Inverse problems in graph theory: nets (Q2417996):
Displaying 14 items.
- Automorphisms of a graph with intersection array \(\{nm - 1, nm - n + m - 1, n - m + 1;1, 1, nm - n + m - 1\}\) (Q828118) (← links)
- Inverse problems of graph theory: generalized quadrangles (Q1669960) (← links)
- A generalized inverse for graphs with absorption (Q1675661) (← links)
- The inverse Voronoi problem in graphs. I: Hardness (Q2006948) (← links)
- Inverse problems in the theory of distance-regular graphs: dual 2-designs (Q2043617) (← links)
- On distance-regular graphs with \(c_2 = 2\) (Q2064382) (← links)
- Distance-regular graphs of diameter 3 without triangles with \(c_2=2\) (Q2100140) (← links)
- Inverse problems of graph theory: graphs without triangles (Q2227043) (← links)
- Automorphisms of small graphs with intersection array \(\{nm-1, nm-n+m-1,n-m+1;1,1,nm-n+m-1\}\) (Q2331136) (← links)
- Inverse problems on a graph with loops (Q2397875) (← links)
- On an extremal inverse problem in graph theory (Q3186815) (← links)
- Inverse Problems and Zero Forcing for Graphs (Q5039750) (← links)
- Inverse problems on graphs: recovering the tree of strings by the BC-method (Q5479016) (← links)
- On small distance-regular graphs with the intersection arrays \( \{mn - 1, (m - 1)(n + 1), n - m + 1; 1, 1, (m - 1)(n + 1)\}\) (Q6089440) (← links)
