The following pages link to Christopher Melekian (Q1694671):
Displayed 10 items.
- Strong matching preclusion number of graphs (Q1694672) (← links)
- Matching preclusion number in product graphs (Q1725689) (← links)
- A note on generalized matching preclusion in bipartite graphs (Q2272412) (← links)
- (Q2971257) (← links)
- Matching Preclusion for the Shuffle-Cubes (Q5087016) (← links)
- A Note on the Steiner<i>k</i>-Diameter of Tensor Product Networks (Q5087855) (← links)
- Matching Preclusion of the Generalized Petersen Graph (Q5205654) (← links)
- Fractional matching preclusion for generalized augmented cubes (Q5207842) (← links)
- A lower bound for the 3-pendant tree-connectivity of lexicographic product graphs (Q5878427) (← links)
- The Steiner (n-3)-diameter of a graph (Q6284211) (← links)