Christopher Melekian

From MaRDI portal
Person:1694671

Available identifiers

zbMath Open melekian.christopherMaRDI QIDQ1694671

List of research outcomes





PublicationDate of PublicationType
A short note on the large Steiner \(k\)-diameter of graphs2025-01-08Paper
A lower bound for the 3-pendant tree-connectivity of lexicographic product graphs2023-02-21Paper
Matching Preclusion for the Shuffle-Cubes2022-07-08Paper
A note on the Steiner \(k\)-diameter of tensor product networks2022-07-04Paper
Fractional matching preclusion for generalized augmented cubes2020-01-13Paper
Matching preclusion of the generalized Petersen graph2019-12-13Paper
A note on generalized matching preclusion in bipartite graphs2019-09-10Paper
Matching preclusion number in product graphs2019-02-14Paper
Strong matching preclusion number of graphs2018-02-06Paper
A note on the conditional matching preclusion problem of the folded Petersen cube2017-04-04Paper
The Steiner (n-3)-diameter of a graph2017-03-11Paper

Research outcomes over time

This page was built for person: Christopher Melekian

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Person:1694671&oldid=6349266"
Powered by MediaWiki