Christopher Melekian

List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

Publication	Date of Publication	Type
A short note on the large Steiner k-diameter of graphs Congressus Numerantium	2025-01-08	Paper
A lower bound for the 3-pendant tree-connectivity of lexicographic product graphs Czechoslovak Mathematical Journal	2023-02-21	Paper
Matching Preclusion for the Shuffle-Cubes Parallel Processing Letters	2022-07-08	Paper
A note on the Steiner k-diameter of tensor product networks Parallel Processing Letters	2022-07-04	Paper
Fractional matching preclusion for generalized augmented cubes (available as arXiv preprint)	2020-01-13	Paper
Fractional matching preclusion for generalized augmented cubes	2020-01-13	Paper
Matching preclusion of the generalized Petersen graph Theory and Applications of Graphs	2019-12-13	Paper
A note on generalized matching preclusion in bipartite graphs Theoretical Computer Science	2019-09-10	Paper
Matching preclusion number in product graphs Theoretical Computer Science	2019-02-14	Paper
Strong matching preclusion number of graphs Theoretical Computer Science	2018-02-06	Paper
A note on the conditional matching preclusion problem of the folded Petersen cube	2017-04-04	Paper
The Steiner (n-3)-diameter of a graph	2017-03-11	Paper

Research outcomes over time

This page was built for person: Christopher Melekian