Christopher Melekian

Orcid: 0000-0002-9491-8757

According to our database1, Christopher Melekian authored at least 13 papers between 2015 and 2020.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2020
Unpaired Many-to-Many Disjoint Path Covers on Bipartite k-Ary n-Cube Networks with Faulty Elements.
Int. J. Found. Comput. Sci., 2020

2019
Matching preclusion number in product graphs.
Theor. Comput. Sci., 2019

A note on generalized matching preclusion in bipartite graphs.
Theor. Comput. Sci., 2019

A Note on the Steiner <i>k</i>-Diameter of Tensor Product Networks.
Parallel Process. Lett., 2019

Steiner Distance in Join, Corona, Cluster, and Threshold Graphs.
J. Inf. Sci. Eng., 2019

Strong matching preclusion problem of the folded Petersen cube.
Int. J. Comput. Math. Comput. Syst. Theory, 2019

Fractional matching preclusion for generalized augmented cubes.
Discret. Math. Theor. Comput. Sci., 2019

2018
Strong matching preclusion number of graphs.
Theor. Comput. Sci., 2018

Matching Preclusion for the Shuffle-Cubes.
Parallel Process. Lett., 2018

A note on the Steiner -diameter of a graph.
Int. J. Comput. Math. Comput. Syst. Theory, 2018

Fractional Matching Preclusion for (Burnt) Pancake Graphs.
Proceedings of the 15th International Symposium on Pervasive Systems, 2018

2017
Steiner Distance in Join, Corona and Threshold Graphs.
Proceedings of the 14th International Symposium on Pervasive Systems, 2017

2015
Matching preclusion and conditional matching preclusion problems for the folded Petersen cube.
Theor. Comput. Sci., 2015


  Loading...