On the extendability of quasi-strongly regular graphs with diameter 2
From MaRDI portal
Publication:2413638
Recommendations
Cites work
- scientific article; zbMATH DE number 4066957 (Why is no real title available?)
- scientific article; zbMATH DE number 166088 (Why is no real title available?)
- scientific article; zbMATH DE number 166089 (Why is no real title available?)
- scientific article; zbMATH DE number 238423 (Why is no real title available?)
- Extending matchings in graphs: A survey
- Graph theory
- Hamiltonian cycles in n‐extendable graphs
- Max-cut and extendability of matchings in distance-regular graphs
- Maximum degree in graphs of diameter 2
- Notes on factor-criticality, extendibility and independence number
- On 2-extendable abelian Cayley graphs
- On extendability of Cayley graphs
- On extendability of Deza graphs with diameter 2
- On n-extendable graphs
- On quasi-strongly regular graphs
- On regular \((2,q)\)-extendable graphs.
- On regular factors in regular graphs with small radius
- The 2-extendability of strongly regular graphs
- The extendability of matchings in strongly regular graphs
Cited in
(10)- scientific article; zbMATH DE number 166088 (Why is no real title available?)
- On quasi-strongly regular graphs with parameters \((n, k, a; k - 2, c_2)\) for \(a < k - 5\)
- On quasi-strongly regular graphs
- On extendability of Deza graphs with diameter 2
- On the second neighbourhoods of quasi-strongly regular graphs
- On extendability of co-edge-regular graphs
- Some constructions of quasi-strongly regular digraphs
- On the fractional matching extendability of Cayley graphs of abelian groups
- The classification of \(2\)-extendable edge-regular graphs with diameter \(2\)
- Maximizing the minimum and maximum forcing numbers of perfect matchings of graphs
This page was built for publication: On the extendability of quasi-strongly regular graphs with diameter 2
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2413638)